SLPA: Uncovering Overlapping Communities in Social Networks via A Speaker-listener Interaction Dynamic Process
arXiv:1109.5720
Abstract
Overlap is one of the characteristics of social networks, in which a person may belong to more than one social group. For this reason, discovering overlapping structures is necessary for realistic social analysis. In this paper, we present a novel, general framework to detect and analyze both individual overlapping nodes and entire communities. In this framework, nodes exchange labels according to dynamic interaction rules. A specific implementation called Speaker-listener Label Propagation Algorithm (SLPA1) demonstrates an excellent performance in identifying both overlapping nodes and overlapping communities with different degrees of diversity.
IEEE ICDM 2011 Workshop on DMCCI [email protected]
References in corpus (6)
- 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
- Detecting the overlapping and hierarchical community structure of complex networks
- Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm
- Efficient Bayesian Community Detection using Non-negative Matrix Factorisation
Cited by in corpus (10)
- Identifying robust communities and multi-community nodes by combining top-down and bottom-up approaches to clustering
- LabelRank: A Stabilized Label Propagation Algorithm for Community Detection in Networks
- Weakly-supervised Fine-grained Event Recognition on Social Media Texts for Disaster Management
- Identifying Influential Nodes Using Overlapping Modularity Vitality
- MeetupNet Dublin: Discovering Communities in Dublin's Meetup Network
- Random Overlapping Communities: Approximating Motif Densities of Large Graphs
- Semi-Supervised Overlapping Community Finding based on Label Propagation with Pairwise Constraints
- An Efficient homophilic model and Algorithms for Community Detection using Nash Dynamics
- High-Quality Disjoint and Overlapping Community Structure in Large-Scale Complex Networks
- Overlapping Community Detection by Local Decentralised Vertex-centred Process