NMLPA: Uncovering Overlapping Communities in Attributed Networks via a Multi-Label Propagation Approach†
AbstractWith the enrichment of the entity information in the real world, many networks with attributed nodes are proposed and studied widely. Community detection in these attributed networks is an essential task that aims to find groups where the intra-nodes are much more densely connected than the inter-nodes. However, many existing community detection methods in attributed networks do not distinguish overlapping communities from non-overlapping communities when designing algorithms. In this paper, we propose a novel and accurate algorithm called Node-similarity-based Multi-Label Propagation Algorithm (NMLPA) for detecting overlapping communities in attributed networks. NMLPA first calculates the similarity between nodes and then propagates multiple labels based on the network structure and the node similarity. Moreover, NMLPA uses a pruning strategy to keep the number of labels per node within a suitable range. Extensive experiments conducted on both synthetic and real-world networks show that our new method significantly outperforms state-of-the-art methods. View Full-Text
Share & Cite This Article
Huang, B.; Wang, C.; Wang, B. NMLPA: Uncovering Overlapping Communities in Attributed Networks via a Multi-Label Propagation Approach. Sensors 2019, 19, 260.
Huang B, Wang C, Wang B. NMLPA: Uncovering Overlapping Communities in Attributed Networks via a Multi-Label Propagation Approach. Sensors. 2019; 19(2):260.Chicago/Turabian Style
Huang, Bingyang; Wang, Chaokun; Wang, Binbin. 2019. "NMLPA: Uncovering Overlapping Communities in Attributed Networks via a Multi-Label Propagation Approach." Sensors 19, no. 2: 260.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.