Extracting the mesoscopic structure from heterogeneous systems

Heterogeneous systems in nature are often characterized by the mesoscopic structure known as communities. In this paper, we propose a framework to address the problem of community detection in bipartite networks and tripartite hypernetworks, which are appropriate models for many heterogeneous systems. The most important advantage of our method is that it is competent for detecting both communities of one-to-one correspondence and communities of many-to-many correspondence, while state of the art techniques can only handle the former. We demonstrate this advantage and show other desired properties of our method through extensive experiments in both synthetic and real-world datasets.

[1]  T. Murata,et al.  Advanced modularity-specialized label propagation algorithm for detecting communities in networks , 2009, 0910.1154.

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

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

[4]  Tsuyoshi Murata,et al.  A New Modularity for Detecting One-to-Many Correspondence of Communities in Bipartite Networks , 2010, Adv. Complex Syst..

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

[6]  C. Bauckhage,et al.  Analyzing Social Bookmarking Systems : A del . icio . us Cookbook , 2008 .

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

[8]  M. Barber.  Modularity and community detection in bipartite networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Roger Guimerà,et al.  Module identification in bipartite and directed networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[12]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

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

[14]  Jimeng Sun,et al.  MetaFac: community discovery via relational hypergraph factorization , 2009, KDD.

[15]  Sergio Gómez,et al.  Size reduction of complex networks preserving modularity , 2007, ArXiv.

[16]  Yi-Cheng Zhang,et al.  Bipartite network projection and personal recommendation. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Guido Caldarelli,et al.  Hypergraph topological quantities for tagged social networks , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[20]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[21]  Tsuyoshi Murata,et al.  Modularity for heterogeneous networks , 2010, HT '10.

[22]  Xiang-Sun Zhang,et al.  Modularity optimization in community detection of complex networks , 2009 .

[23]  Ken Wakita,et al.  Extracting Multi-facet Community Structure from Bipartite Networks , 2009, 2009 International Conference on Computational Science and Engineering.

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

[25]  K. Obermayer,et al.  Towards Community Detection in k-Partite k-Uniform Hypergraphs , 2009 .

[26]  Kathleen M. Carley,et al.  Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers , 2004 .

[27]  Tsuyoshi Murata.  Detecting communities from tripartite networks , 2010, WWW '10.

[28]  Xin Chen,et al.  Exploit the tripartite network of social tagging for web clustering , 2009, CIKM.

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

[30]  Stephen Chadwick,et al.  The Deep South , 2012 .

[31]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

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

[33]  Amedeo Caflisch,et al.  Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  A. Medus,et al.  Detection of community structures in networks via global optimization , 2005 .