›› 2015, Vol. 24 ›› Issue (1): 18703-018703.doi: 10.1088/1674-1056/24/1/018703
• INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY • 上一篇 下一篇
孙鹤立a b, 黄健斌b c, 田勇强c, 宋擒豹a, 刘怀亮d
Sun He-Li (孙鹤立)a b, Huang Jian-Bin (黄健斌)b c, Tian Yong-Qiang (田勇强)c, Song Qin-Bao (宋擒豹)a, Liu Huai-Liang (刘怀亮)d
摘要: Community detection is an important methodology for understanding the intrinsic structure and function of a real-world network. In this paper, we propose an effective and efficient algorithm, called Dominant Label Propagation Algorithm (Abbreviated as DLPA), to detect communities in complex networks. The algorithm simulates a special voting process to detect overlapping and non-overlapping community structure in complex networks simultaneously. Our algorithm is very efficient, since its computational complexity is almost linear to the number of edges in the network. Experimental results on both real-world and synthetic networks show that our algorithm also possesses high accuracies on detecting community structure in networks.
中图分类号: (Structures and organization in complex systems)