Link community detection through global optimization and the inverse resolution limit of partition density
arXiv:1601.05100 · doi:10.1038/s41598-017-12432-1
Abstract
We investigate the possibility of global optimization-based overlapping community detection, using link community framework. We first show that partition density, the original quality function used in link community detection method, is not suitable as a quality function for global optimization because it prefers breaking communities into triangles except in highly limited conditions. We analytically derive those conditions and confirm it with computational results on direct optimization of various synthetic and real-world networks. To overcome this limitation, we propose alternative approaches combining the weighted line graph transformation and existing quality functions for node-based communities. We suggest a new line graph weighting scheme, a normalized Jaccard index. Computational results show that community detection using the weighted line graphs generated with the normalized Jaccard index leads to a more accurate community structure.
20 pages, 8 figures
References in corpus (13)
- Uncovering the overlapping community structure of complex networks in nature and society
- Maps of random walks on complex networks reveal community structure
- Resolution limit in community detection
- Detecting the overlapping and hierarchical community structure of complex networks
- Finding statistically significant communities in networks
- Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
- Line Graphs, Link Partitions and Overlapping Communities
- Analysis of the structure of complex networks at different resolution levels
- Parsimonious module inference in large networks
- Detecting communities using asymptotical Surprise
- Surprise maximization reveals the community structure of complex networks
- Evaluating accuracy of community detection using the relative normalized mutual information
- MOCSA: multiobjective optimization by conformational space annealing