Computational Complexities of Optimization Problems Related to Model-Based Clustering of Networks View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2014-05-08

AUTHORS

Bhaskar DasGupta

ABSTRACT

An extremely popular model-based graph partitioning approach that is used for both biological and social networks is the so-called modularity optimization approach originally proposed by Newman and its variations. In this chapter, we review several combinatorial and algebraic methods that have been used in the literature to study the computational complexities of these optimization problems. More... »

PAGES

97-113

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-1-4939-0808-0_5

DOI

http://dx.doi.org/10.1007/978-1-4939-0808-0_5

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1024341060


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0103", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Numerical and Computational Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Illinois at Chicago, 50507, Chicago, IL, USA", 
          "id": "http://www.grid.ac/institutes/grid.185648.6", 
          "name": [
            "Department of Computer Science, University of Illinois at Chicago, 50507, Chicago, IL, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "DasGupta", 
        "givenName": "Bhaskar", 
        "id": "sg:person.0763403270.10", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0763403270.10"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2014-05-08", 
    "datePublishedReg": "2014-05-08", 
    "description": "An extremely popular model-based graph partitioning approach that is used for both biological and social networks is the so-called modularity optimization approach originally proposed by Newman and its variations. In this chapter, we review several combinatorial and algebraic methods that have been used in the literature to study the computational complexities of these optimization problems.", 
    "editor": [
      {
        "familyName": "Rassias", 
        "givenName": "Themistocles M.", 
        "type": "Person"
      }, 
      {
        "familyName": "Floudas", 
        "givenName": "Christodoulos A.", 
        "type": "Person"
      }, 
      {
        "familyName": "Butenko", 
        "givenName": "Sergiy", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-1-4939-0808-0_5", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-1-4939-0807-3", 
        "978-1-4939-0808-0"
      ], 
      "name": "Optimization in Science and Engineering", 
      "type": "Book"
    }, 
    "keywords": [
      "optimization problem", 
      "computational complexity", 
      "algebraic method", 
      "optimization approach", 
      "clustering of networks", 
      "social networks", 
      "problem", 
      "complexity", 
      "graph", 
      "network", 
      "approach", 
      "model", 
      "clustering", 
      "Newman", 
      "variation", 
      "chapter", 
      "method", 
      "literature"
    ], 
    "name": "Computational Complexities of Optimization Problems Related to Model-Based Clustering of Networks", 
    "pagination": "97-113", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1024341060"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-1-4939-0808-0_5"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-1-4939-0808-0_5", 
      "https://app.dimensions.ai/details/publication/pub.1024341060"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:47", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_405.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-1-4939-0808-0_5"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-1-4939-0808-0_5'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-1-4939-0808-0_5'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-1-4939-0808-0_5'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-1-4939-0808-0_5'


 

This table displays all metadata directly associated to this object as RDF triples.

96 TRIPLES      23 PREDICATES      44 URIs      35 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-1-4939-0808-0_5 schema:about anzsrc-for:01
2 anzsrc-for:0103
3 anzsrc-for:08
4 anzsrc-for:0802
5 schema:author Nfc0b3d0ea52541dab6cd610b59a4ffb5
6 schema:datePublished 2014-05-08
7 schema:datePublishedReg 2014-05-08
8 schema:description An extremely popular model-based graph partitioning approach that is used for both biological and social networks is the so-called modularity optimization approach originally proposed by Newman and its variations. In this chapter, we review several combinatorial and algebraic methods that have been used in the literature to study the computational complexities of these optimization problems.
9 schema:editor N71cc8333e4e44d8da034fbcebcb4c8b6
10 schema:genre chapter
11 schema:inLanguage en
12 schema:isAccessibleForFree false
13 schema:isPartOf Nf32fb72f031c4ccf9b8a743a35f3f7d0
14 schema:keywords Newman
15 algebraic method
16 approach
17 chapter
18 clustering
19 clustering of networks
20 complexity
21 computational complexity
22 graph
23 literature
24 method
25 model
26 network
27 optimization approach
28 optimization problem
29 problem
30 social networks
31 variation
32 schema:name Computational Complexities of Optimization Problems Related to Model-Based Clustering of Networks
33 schema:pagination 97-113
34 schema:productId N89646596bc4b4b98a47d349cc1e1ca38
35 Nc5446f25e41a4e9e8c532274398b4814
36 schema:publisher N59d3fb98ab204e7e83e710a8ddacc8c4
37 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024341060
38 https://doi.org/10.1007/978-1-4939-0808-0_5
39 schema:sdDatePublished 2022-05-20T07:47
40 schema:sdLicense https://scigraph.springernature.com/explorer/license/
41 schema:sdPublisher Nd0fe8de811e6484ca2957dbd1c7c83ba
42 schema:url https://doi.org/10.1007/978-1-4939-0808-0_5
43 sgo:license sg:explorer/license/
44 sgo:sdDataset chapters
45 rdf:type schema:Chapter
46 N187f8d901d9c45a09b73e54f0eeb439f schema:familyName Butenko
47 schema:givenName Sergiy
48 rdf:type schema:Person
49 N52468078915949bc95d13aaac7f080b4 schema:familyName Rassias
50 schema:givenName Themistocles M.
51 rdf:type schema:Person
52 N59d3fb98ab204e7e83e710a8ddacc8c4 schema:name Springer Nature
53 rdf:type schema:Organisation
54 N71cc8333e4e44d8da034fbcebcb4c8b6 rdf:first N52468078915949bc95d13aaac7f080b4
55 rdf:rest Na0ebc344964145f5a1f64e6fb7026ab1
56 N89646596bc4b4b98a47d349cc1e1ca38 schema:name dimensions_id
57 schema:value pub.1024341060
58 rdf:type schema:PropertyValue
59 Na0ebc344964145f5a1f64e6fb7026ab1 rdf:first Nfc743426635843a88611594ab6ef45a1
60 rdf:rest Ne9466fb67bb7470bae9ffe99f6b3fc12
61 Nc5446f25e41a4e9e8c532274398b4814 schema:name doi
62 schema:value 10.1007/978-1-4939-0808-0_5
63 rdf:type schema:PropertyValue
64 Nd0fe8de811e6484ca2957dbd1c7c83ba schema:name Springer Nature - SN SciGraph project
65 rdf:type schema:Organization
66 Ne9466fb67bb7470bae9ffe99f6b3fc12 rdf:first N187f8d901d9c45a09b73e54f0eeb439f
67 rdf:rest rdf:nil
68 Nf32fb72f031c4ccf9b8a743a35f3f7d0 schema:isbn 978-1-4939-0807-3
69 978-1-4939-0808-0
70 schema:name Optimization in Science and Engineering
71 rdf:type schema:Book
72 Nfc0b3d0ea52541dab6cd610b59a4ffb5 rdf:first sg:person.0763403270.10
73 rdf:rest rdf:nil
74 Nfc743426635843a88611594ab6ef45a1 schema:familyName Floudas
75 schema:givenName Christodoulos A.
76 rdf:type schema:Person
77 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
78 schema:name Mathematical Sciences
79 rdf:type schema:DefinedTerm
80 anzsrc-for:0103 schema:inDefinedTermSet anzsrc-for:
81 schema:name Numerical and Computational Mathematics
82 rdf:type schema:DefinedTerm
83 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
84 schema:name Information and Computing Sciences
85 rdf:type schema:DefinedTerm
86 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
87 schema:name Computation Theory and Mathematics
88 rdf:type schema:DefinedTerm
89 sg:person.0763403270.10 schema:affiliation grid-institutes:grid.185648.6
90 schema:familyName DasGupta
91 schema:givenName Bhaskar
92 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0763403270.10
93 rdf:type schema:Person
94 grid-institutes:grid.185648.6 schema:alternateName Department of Computer Science, University of Illinois at Chicago, 50507, Chicago, IL, USA
95 schema:name Department of Computer Science, University of Illinois at Chicago, 50507, Chicago, IL, USA
96 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...