An improvement of the fast uncovering community algorithm

• Published in: Chinese physics B Vol. 22; no. 10; pp. 646 - 653
• Main Author: 王莉 王将 沈华伟 程学旗
• Format: Journal Article
• Language: English
• Published: 01.10.2013
• Subjects: Algorithms; Biology; Communities; Constants; Optimization; Sociology; Strategy; Swing; 性能; 数据集; 社会学; 社会结构; 算法; 自适应加权; 节点; 计算成本
• ISSN: 1674-1056; 2058-3834; 1741-4199
• DOI: 10.1088/1674-1056/22/10/108903

Community detection methods have been used in computer, sociology, physics, biology, and brain information science areas. Many methods are based on the optimization of modularity. The algorithm proposed by Blondel et al. （Blondel V D, Guillaume J L, Lambiotte R and Lefebvre E 2008 J. Star. Mech. 10 10008） is one of the most widely used methods because of its good performance, especially in the big data era. In this paper we make some improvements to this algorithm in correctness and performance. By tests we see that different node orders bring different performances and different community structures. We find some node swings in different communities that influence the performance. So we design some strategies on the sweeping order of node to reduce the computing cost made by repetition swing. We introduce a new concept of overlapping degree （OV） that shows the strength of connection between nodes. Three improvement strategies are proposed that are based on constant OV, adaptive OV, and adaptive weighted OV, respectively. Experiments on synthetic datasets and real datasets are made, showing that our improved strategies can improve the performance and correctness.