arXiv · 0808.2633
Towards real-time community detection in large networks
Abstract
The recent boom of large-scale Online Social Networks (OSNs) both enables and necessitates the use of parallelisable and scalable computational techniques for their analysis. We examine the problem of real-time community detection and a recently proposed linear time - O(m) on a network with m edges - label propagation or "epidemic" community detection algorithm. We identify characteristics and drawbacks of the algorithm and extend it by incorporating different heuristics to facilitate reliable and multifunctional real-time community detection. With limited computational resources, we employ the algorithm on OSN data with 1 million nodes and about 58 million directed edges. Experiments and benchmarks reveal that the extended algorithm is not only faster but its community detection accuracy is compared favourably over popular modularity-gain optimization algorithms known to suffer from their resolution limits.
Explore related subjects
Keep this discovery
Ian X. Y. Leung, Pan Hui, Pietro Lio', Jon Crowcroft. 2009-06-20. Towards real-time community detection in large networks. https://doi.org/10.1103/physreve.79.066107
Cite the original work for its findings. Save a collection to share your selection of sources.