Comparison and validation of community structures in complex networks

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Search: WFRF:(Lombardi Anna 1965 ) > Comparison and vali...

Details
MARC

Gustafsson, Mika,1977-Linköpings universitet,Institutionen för teknik och naturvetenskap,Tekniska högskolan (author)

Comparison and validation of community structures in complex networks

Article/chapterEnglish2006

Publisher, publication year, extent ...

Elsevier BV,2006
printrdacarrier

Numbers

LIBRIS-ID:oai:DiVA.org:liu-32261
https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-32261URI
https://doi.org/10.1016/j.physa.2005.12.017DOI

Supplementary language notes

Language:English
Summary in:English

Part of subdatabase

SwePubSwePub

Classification

Subject category:ref swepub-contenttype
Subject category:art swepub-publicationtype

Notes

The issue of partitioning a network into communities has attracted a great deal of attention recently. Most authors seem to equate this issue with the one of finding the maximum value of the modularity, as defined by Newman. Since the problem formulated this way is believed to be NP-hard, most effort has gone into the construction of search algorithms, and less to the question of other measures of community structures, similarities between various partitionings and the validation with respect to external information.Here we concentrate on a class of computer generated networks and on three well-studied real networks which constitute a bench-mark for network studies; the karate club, the US college football teams and a gene network of yeast. We utilize some standard ways of clustering data (originally not designed for finding community structures in networks) and show that these classical methods sometimes outperform the newer ones. We discuss various measures of the strength of the modular structure, and show by examples features and drawbacks. Further, we compare different partitions by applying some graph-theoretic concepts of distance, which indicate that one of the quality measures of the degree of modularity corresponds quite well with the distance from the true partition. Finally, we introduce a way to validate the partitionings with respect to external data when the nodes are classified but the network structure is unknown. This is here possible since we know everything of the computer generated networks, as well as the historical answer to how the karate club and the football teams are partitioned in reality. The partitioning of the gene network is validated by use of the Gene Ontology database, where we show that a community in general corresponds to a biological process.

Subject headings and genre

Network
Community
Validation
Distance measure
Hierarchical clustering
K-means
GO
TECHNOLOGY
TEKNIKVETENSKAP

Added entries (persons, corporate bodies, meetings, titles ...)

Hörnquist, Michael,1969-Linköpings universitet,Institutionen för teknik och naturvetenskap,Tekniska högskolan(Swepub:liu)micho58 (author)
Lombardi, Anna,1965-Linköpings universitet,Institutionen för teknik och naturvetenskap,Tekniska högskolan(Swepub:liu)annlo98 (author)
Linköpings universitetInstitutionen för teknik och naturvetenskap (creator_code:org_t)

Related titles

In:Physica A: Elsevier BV367, s. 559-5760378-43711873-2119

Internet link

Find in a library

Physica A (Search for host publication in LIBRIS)

To the university's database

Find more in SwePub

By the author/editor: Gustafsson, Mika ...; Hörnquist, Micha ...; Lombardi, Anna, ...

Articles in the publication: Physica A

By the university: Linköping University

Search outside SwePub

Extend your search to:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se