a parameter-free community detection method based on centrality and dispersion of nodes in complex networks：一种基于网络中心性和分散性的无参数社区检测方法.pdf

Physica A 438 (2015) 321–334 Contents lists available at ScienceDirect Physica A journal homepage: /locate/physa A parameter-free community detection method based on centrality and dispersion of nodes in complex networks Yafang Li, Caiyan Jia ∗, Jian Yu Beijing Key Lab of Traffic Data Analysis and Mining, School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China h i g h l i g h t s • Parameter-free to decide initial centers and the number of communities. • A modified centrality measurement is presented. • High accuracy of the proposed K-rank-D compared with other algorithms. a r t i c l e i n f o a b s t r a c t Article history: K-means is a simple and efficient clustering algorithm to detect communities in networks. Received 6 January 2015 However, it may suffer from a bad choice of initial seeds (also called centers) that seri- Received in revised form 25 March 2015 ously affect the clustering accuracy and the convergence rate. Additionally, in K-means, Available online 9 July 2015 the number of communities should be specified in advance. Till now, it is still an open problem on how to select initial seeds and how to determine the number of communities. Keywords: In this study, a new parameter-free community detection method (named K-rank-D) was Clustering proposed. First, based on the fact that good initial seeds usually have high importance and Community detection Rank centrality