Journal of Northeastern University Natural Science ›› 2019, Vol. 40 ›› Issue (2): 186-191.DOI: 10.12068/j.issn.1005-3026.2019.02.007

• Information & Control • Previous Articles     Next Articles

Community Detection Algorithm for Complex Networks Based on Group Density

CHEN Dong-ming, WANG Yun-kai, HUANG Xin-yu, WANG Dong-qi   

  1. School of Software, Northeastern University, Shenyang 110169, China.
  • Received:2017-11-01 Revised:2017-11-01 Online:2019-02-15 Published:2019-02-12
  • Contact: WANG Yun-kai
  • About author:-
  • Supported by:
    -

Abstract: Most of the traditional community detection algorithms cannot balance partitioning effect and complexity well. So, this paper presents a new evaluation standard of single community called group density. Based on the group density, a community detection algorithm based on agglomeration is proposed. The algorithm continues to integrate small communities, and makes the community structure of the network develop in the direction of maximizing average group density. Modularity is employed to detect the partitioning effect of the algorithm. Experimental results demonstrate that the new algorithm outperforms the traditional GN, Fast Newman, LPA algorithms in multiple data sets, which shows that the algorithm proposed has better partitioning effect and lower time complexity.

Key words: complex network, community structure, community detection, modularity, group density

CLC Number: