Subspace Based Network Community Detection Using Sparse Linear Coding

Information mining from networks by identifying communities is an important problem across a number of research fields including social science, biology, physics, and medicine. Most existing community detection algorithms are graph theoretic and lack the ability to detect accurate community boundaries if the ratio of intra-community to inter-community links is low. Also, algorithms based on modularity maximization may fail to resolve communities smaller than a specific size if the community size varies significantly. In this paper, we present a fundamentally different community detection algorithm based on the fact that each network community spans a different subspace in the geodesic space. Therefore, each node can only be efficiently represented as a linear combination of nodes spanning the same subspace. To make the process of community detection more robust, we use sparse linear coding with l1 norm constraint. In order to find a community label for each node, sparse spectral clustering algorithm is used. The proposed community detection technique is compared with more than 10 state of the art methods on two benchmark networks (with known clusters) using normalized mutual information criterion. Our proposed algorithm outperformed existing algorithms with a significant margin on both benchmark networks. The proposed algorithm has also shown excellent performance on three real-world networks.

[1]  Michalis Vazirgiannis,et al.  Clustering and Community Detection in Directed Networks: A Survey , 2013, ArXiv.

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

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

[4]  Yousef Saad,et al.  Dense Subgraph Extraction with Application to Community Detection , 2012, IEEE Transactions on Knowledge and Data Engineering.

[5]  Chen Li,et al.  Community detection in complex networks by density-based clustering , 2013 .

[6]  Arif Mahmood,et al.  Subspace Based Network Community Detection Using Sparse Linear Coding , 2016, IEEE Trans. Knowl. Data Eng..

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

[8]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[9]  Filippo Radicchi,et al.  A paradox in community detection , 2013, ArXiv.

[10]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[11]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

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

[14]  Arif Mahmood,et al.  Semi-supervised Spectral Clustering for Image Set Classification , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[15]  Leon Danon,et al.  The effect of size heterogeneity on community identification in complex networks , 2006, physics/0601144.

[16]  Shaoting Tang,et al.  A new approach to shortest paths on networks based on the quantum bosonic mechanism , 2011 .

[17]  R. Tibshirani,et al.  Least angle regression , 2004, math/0406456.

[18]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[19]  Huan Liu,et al.  Identifying Evolving Groups in Dynamic Multimode Networks , 2012, IEEE Transactions on Knowledge and Data Engineering.

[20]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[21]  Boleslaw K. Szymanski,et al.  Towards Linear Time Overlapping Community Detection in Social Networks , 2012, PAKDD.

[22]  Jie Liu,et al.  Novel heuristic density-based method for community detection in networks , 2014 .

[23]  Ying Liu,et al.  Network Community Structure Detection for Directional Neural Networks Inferred From Multichannel Multisubject EEG Data , 2014, IEEE Transactions on Biomedical Engineering.

[24]  S. Dongen Graph clustering by flow simulation , 2000 .

[25]  Santo Fortunato,et al.  Community detection in networks: Structural communities versus ground truth , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  H. Vincent Poor,et al.  The Evolution of Online Social Networks: A tutorial survey , 2012, IEEE Signal Processing Magazine.

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

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

[29]  René Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications , 2012, IEEE transactions on pattern analysis and machine intelligence.

[30]  Pasquale De Meo,et al.  Mixing local and global information for community detection in large networks , 2013, J. Comput. Syst. Sci..

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

[32]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[33]  Santo Fortunato,et al.  Limits of modularity maximization in community detection , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[35]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

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

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

[38]  P. Ronhovde,et al.  Multiresolution community detection for megascale networks by information-based replica correlations. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[40]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[41]  Guanrong Chen,et al.  Complex networks: small-world, scale-free and beyond , 2003 .

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

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

[44]  Marco Aiello,et al.  The Power Grid as a Complex Network: a Survey , 2011, ArXiv.

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

[46]  R. F. Cancho,et al.  Topology of technology graphs: small world patterns in electronic circuits. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[47]  Guillermo Sapiro,et al.  Online dictionary learning for sparse coding , 2009, ICML '09.

[48]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[49]  Mária Ercsey-Ravasz,et al.  Community detection by graph Voronoi diagrams , 2014 .

[50]  Fergal Reid,et al.  Percolation Computation in Complex Networks , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[51]  D. Watts Networks, Dynamics, and the Small‐World Phenomenon1 , 1999, American Journal of Sociology.

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

[53]  Philip S. Yu,et al.  NEIWalk: Community Discovery in Dynamic Content-Based Networks , 2014, IEEE Transactions on Knowledge and Data Engineering.

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