A Fast Method of Detecting Overlapping Community in Network Based on LFM

Detect overlapping communities efficiently and effectively in various social networks has been more and more important. Aiming at the high complexity of expanding strategy and the defect of generating many homeless nodes in LFM, we propose a quick algorithm based on local optimization of a fitness function(QLFM). The proposed algorithm firstly select a node as seed randomly .With a local fitness function ,the algorithm then will expand from inside to outside of the seed according to the Breadth-First-Search in graph. As different seeds will expand to different communities independently ,and these communities have same nodes ,thus our method can detect overlapping nodes quickly and efficiently. An empirical evaluation of the method using real and synthetic datasets shows that the method give better result not only in time efficiency, but also in quality aspect than other methods at the overlapping community detection.

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

[2]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[3]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

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

[5]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

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

[7]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[8]  Andreas W. M. Dress,et al.  A spectral clustering-based framework for detecting community structures in complex networks , 2009, Appl. Math. Lett..

[9]  Marko Bajec,et al.  Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Dino Pedreschi,et al.  DEMON: a local-first discovery method for overlapping communities , 2012, KDD.

[12]  Ronghua Shang,et al.  Community detection based on modularity and an improved genetic algorithm , 2013 .

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

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

[15]  Xueqi Cheng,et al.  Spectral methods for the detection of network community structure: a comparative analysis , 2010, ArXiv.

[16]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[17]  T. Vicsek,et al.  Weighted network modules , 2007, cond-mat/0703706.

[18]  V. Carchiolo,et al.  Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.

[19]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  J. Kumpula,et al.  Sequential algorithm for fast clique percolation. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.