Efficient Detection of Communities with Significant Overlaps in Networks: Partial Community Merger Algorithm
arXiv:1509.00556 · doi:10.1017/nws.2017.32
Abstract
Detecting communities in large-scale networks is a challenging task when each vertex may belong to multiple communities, as is often the case in social networks. The multiple memberships of vertices and thus the strong overlaps among communities render many detection algorithms invalid. We develop a Partial Community Merger Algorithm (PCMA) for detecting communities with significant overlaps as well as slightly overlapping and disjoint ones. It is a bottom-up approach based on properly reassembling partial information of communities revealed in ego networks of vertices to reconstruct complete communities. Noise control and merger order are the two key issues in implementing this idea. We propose a novel similarity measure between two merged communities that can suppress noise and an efficient algorithm that recursively merges the most similar pair of communities. The validity and accuracy of PCMA is tested against two benchmarks and compared to four existing algorithms. It is the most efficient one with linear complexity and it outperforms the compared algorithms when vertices have multiple memberships. PCMA is applied to two huge online social networks, Friendster and Sina Weibo. Millions of communities are detected and they are of higher qualities than the corresponding metadata groups. We find that the latter should not be regarded as the ground-truth of structural communities. The significant overlapping pattern found in the detected communities confirms the need of new algorithms, such as PCMA, to handle multiple memberships of vertices in social networks.
References in corpus (20)
- Community structure in social and biological networks
- Community detection in graphs
- Uncovering the overlapping community structure of complex networks in nature and society
- Near linear time algorithm to detect community structures in large-scale networks
- Benchmark graphs for testing community detection algorithms
- Comparing community structure identification
- Defining and identifying communities in networks
- Link communities reveal multiscale complexity in networks
- Detecting the overlapping and hierarchical community structure of complex networks
- Finding statistically significant communities in networks
- Overlapping Community Detection in Networks: the State of the Art and Comparative Study
- Finding overlapping communities in networks by label propagation
- Line Graphs, Link Partitions and Overlapping Communities
- An efficient and principled method for detecting communities in networks
- Community detection in networks: Structural communities versus ground truth
- Assessing the relevance of node features for network structure
- Line Graphs of Weighted Networks for Overlapping Communities
- Fuzzy overlapping communities in networks
- Statistical significance of communities in networks
- Evaluating accuracy of community detection using the relative normalized mutual information