Consensus clustering in complex networks
arXiv:1203.6093 · doi:10.1038/srep00336
Abstract
The community structure of complex networks reveals both their organization and hidden relationships among their constituents. Most community detection methods currently available are not deterministic, and their results typically depend on the specific random seeds, initial conditions and tie-break rules adopted for their execution. Consensus clustering is used in data analysis to generate stable results out of a set of partitions delivered by stochastic methods. Here we show that consensus clustering can be combined with any existing method in a self-consistent way, enhancing considerably both the stability and the accuracy of the resulting partitions. This framework is also particularly suitable to monitor the evolution of community structure in temporal networks. An application of consensus clustering to a large citation network of physics papers demonstrates its capability to keep track of the birth, death and diversification of topics.
11 pages, 12 figures. Published in Scientific Reports
References in corpus (13)
- Modularity and community structure in networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Maps of random walks on complex networks reveal community structure
- Near linear time algorithm to detect community structures in large-scale networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Hierarchical structure and the prediction of missing links in networks
- Detecting the overlapping and hierarchical community structure of complex networks
- Quantifying social group evolution
- Finding statistically significant communities in networks
- Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
- Extracting the hierarchical organization of complex systems
- Qualitative Comparison of Community Detection Algorithms