LPA-CBD an improved label propagation algorithm based on community belonging degree for community detection

In order to deal with stochasticity in center node selection and instability in community detection of label propagation algorithm, this paper proposes an improved label propagation algorithm named label propagation algorithm based on community belonging degree (LPA-CBD) that employs community belonging degree to determine the number and the center of community. The general process of LPA-CBD is that the initial community is identified by the nodes with the maximum degree, and then it is optimized or expanded by community belonging degree. After getting the rough structure of network community, the remaining nodes are labeled by using label propagation algorithm. The experimental results on 10 real-world networks and three synthetic networks show that LPA-CBD achieves reasonable community number, better algorithm accuracy and higher modularity compared with other four prominent algorithms. Moreover, the proposed algorithm not only has lower algorithm complexity and higher community detection quality, but also improves the stability of the original label propagation algorithm.

[1]  Mohsen Afsharchi,et al.  Community detection in social networks using hybrid merging of sub-communities , 2014, J. Netw. Comput. Appl..

[2]  David D. Jensen,et al.  Graph clustering with network structure indices , 2007, ICML '07.

[3]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Wesley W. Chu,et al.  Drug exposure side effects from mining pregnancy data , 2007, SKDD.

[5]  Chris Phillips,et al.  Parallel numerical algorithms , 1992, Prentice Hall International Series in Computer Science.

[6]  Dong Liu,et al.  Semi-supervised community detection based on discrete potential theory , 2014 .

[7]  Fergal Reid,et al.  Partitioning Breaks Communities , 2011, ASONAM.

[8]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[9]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Tang,et al.  Self-Organized Criticality: An Explanation of 1/f Noise , 2011 .

[11]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[12]  Martin Rosvall,et al.  An information-theoretic framework for resolving community structure in complex networks , 2007, Proceedings of the National Academy of Sciences.

[13]  Duanbing Chen,et al.  A fast and efficient heuristic algorithm for detecting community structures in complex networks , 2009 .

[14]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[15]  Li Zhang,et al.  Learning similarity with cosine similarity ensemble , 2015, Inf. Sci..

[16]  M. A. Muñoz,et al.  Journal of Statistical Mechanics: An IOP and SISSA journal Theory and Experiment Detecting network communities: a new systematic and efficient algorithm , 2004 .

[17]  Albert-László Barabási,et al.  Hierarchical organization in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Zoubin Ghahramani,et al.  Learning from labeled and unlabeled data with label propagation , 2002 .

[19]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[20]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[21]  David Lusseau,et al.  The emergent properties of a dolphin social network , 2003, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[22]  Yonggang Lu,et al.  A novel travel-time based similarity measure for hierarchical clustering , 2016, Neurocomputing.

[23]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[24]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[25]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[26]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[27]  Mao-Bin Hu,et al.  Detect overlapping and hierarchical community structure in networks , 2008, ArXiv.

[28]  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.

[29]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.