A Hybrid Spectral Method for Network Community Detection

Community detection has been paid much attention, and a large number of community-detection methods have been proposed in the last decade. Spectral methods are widely used in many applications due to their solid mathematical foundations. In this paper, we propose a hybrid spectral method to effectively identify communities from networks. This method begins with a network-sparsification operation, which is expected to remove some between-community edges from the network to make the community boundaries clearer and sharper, then it utilizes an iterative spectral bisection algorithm to partition the network into small communities, and finally some of the small communities are merged to obtain the resulting community structure. We conducted extensive experiments on five real-world networks and two artificial networks, the experimental results show that our proposed method can extract high-quality community structures from networks effectively.

[1]  Kun He,et al.  Local Lanczos Spectral Approximation for Community Detection , 2017, ECML/PKDD.

[2]  Mark E. J. Newman,et al.  Spectral methods for network community detection and graph partitioning , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[4]  Michelle Girvan,et al.  Erratum: Spectral properties of networks with community structure [Phys. Rev. E 80, 056114 (2009)] , 2012 .

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

[6]  Mingwei Leng,et al.  A divisive spectral method for network community detection , 2015, ArXiv.

[7]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[10]  Yanjun Ma,et al.  Mining User's Real Social Circle in Microblog , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[11]  Xiao Zhang,et al.  Spectra of random graphs with community structure and arbitrary degrees , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Martijn P. van den Heuvel,et al.  The Laplacian spectrum of neural networks , 2014, Front. Comput. Neurosci..

[13]  Martin Rosvall,et al.  Multilevel Compression of Random Walks on Networks Reveals Hierarchical Organization in Large Integrated Systems , 2010, PloS one.

[14]  Mariá Cristina Vasconcelos Nascimento,et al.  Community detection in networks via a spectral heuristic based on the clustering coefficient , 2014, Discret. Appl. Math..

[15]  Huawei Shen,et al.  Covariance, correlation matrix, and the multiscale community structure of networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Kyle Luh,et al.  Community Detection Using Spectral Clustering on Sparse Geosocial Data , 2012, SIAM J. Appl. Math..

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

[18]  A. Barabasi,et al.  Uncovering disease-disease relationships through the incomplete interactome , 2015, Science.

[19]  Jon Kleinberg,et al.  The Structure of the Web , 2001, Science.

[20]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

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

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

[23]  Tony F. Chan,et al.  On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method , 1997, SIAM J. Sci. Comput..

[24]  Mattias Johansson,et al.  Genetic Variability of the mTOR Pathway and Prostate Cancer Risk in the European Prospective Investigation on Cancer (EPIC) , 2011, PloS one.

[25]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.

[26]  Alex Arenas,et al.  Synchronization reveals topological scales in complex networks. , 2006, Physical review letters.

[27]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

[28]  E. Ott,et al.  Spectral properties of networks with community structure. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[30]  Marjan Kuchaki Rafsanjani,et al.  Community detection in complex networks using structural similarity , 2018, Physica A: Statistical Mechanics and its Applications.

[31]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[32]  Xue-Qi Cheng,et al.  Uncovering the community structure associated with the diffusion dynamics on networks , 2009, 0911.2308.

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

[34]  Charlotte M. Deane,et al.  The function of communities in protein interaction networks at multiple scales , 2009, BMC Systems Biology.

[35]  Xingyi Zhang,et al.  A seed-expanding method based on random walks for community detection in networks with ambiguous community structures , 2017, Scientific Reports.

[36]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[38]  Azadeh Shakery,et al.  Personalized PageRank Clustering: A graph clustering algorithm based on random walks , 2013 .

[39]  Jian-Guo Liu,et al.  Detecting community structure in complex networks via node similarity , 2010 .

[40]  G. Caldarelli,et al.  Detecting communities in large networks , 2004, cond-mat/0402499.

[41]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[42]  Nitesh V. Chawla,et al.  Identifying and evaluating community structure in complex networks , 2010, Pattern Recognit. Lett..