An improved community detection algorithm based on modified local expansion method

Community detection is an important research issue in complex network mining. In this paper, firstly, we define central nodes, called Extended Local Max-Degree (ELMD) nodes in a complex network. All the central nodes are used for the community expanding. We also prove that ELMD method is more precise and dispersed than local max-degree method in the real datasets. Secondly, we propose an improved local expansion method to expand community from the seeds (ELMD nodes), and this process is named as Extended Local Community Expansion with Modified R method (ELCEMR). ELCEMR is an unsupervised learning method, and does not need any priori-knowledge. Finally, the validations against the real-world datasets show that the proposed method performs better than other algorithms for community detection.

[1]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Osmar R. Zaïane,et al.  Top Leaders Community Detection Approach in Information Networks , 2010 .

[3]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[4]  M. Cugmas,et al.  On comparing partitions , 2015 .

[5]  M. S. Aldayel.  K-Nearest Neighbor classification for glass identification problem , 2012, 2012 International Conference on Computer Systems and Industrial Informatics.

[6]  L. Collins,et al.  Omega: A General Formulation of the Rand Index of Cluster Recovery Suitable for Non-disjoint Solutions. , 1988, Multivariate behavioral research.

[7]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[8]  Gueorgi Kossinets,et al.  Empirical Analysis of an Evolving Social Network , 2006, Science.

[9]  Lili Zhang,et al.  An Efficient Hierarchy Algorithm for Community Detection in Complex Networks , 2014 .

[10]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[11]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Qiong Chen,et al.  An Efficient Algorithm for Community Detection in Complex Networks , 2012 .

[13]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.