1. 基于社团密合度的复杂网络社团发现算法.
- Author
-
陈东明, 王云开, 黄新宇, and 王冬琦
- 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. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF