Evaluating Community Structure in Bipartite Networks

Communities in unipartite networks are often understood as groups of nodes within which links are dense but between which links are sparse. Such communities are not suited to bipartite networks, as there is only one-to-one correspondence between communities of different types. Recently, B. Long et al. Introduced the link-pattern based community, which allows many-to-many correspondence between communities. In this paper, we propose a measure for evaluating the goodness of different partitions of a bipartite network into link-pattern based communities. Such a measure is useful for both comparing various community detection methods and devising new community detection algorithm based on optimization. We demonstrate the effectiveness of the proposed measure using the famous Southern women bipartite network.

[1]  A. Barabasi,et al.  Network biology: understanding the cell's functional organization , 2004, Nature Reviews Genetics.

[2]  Ana L. N. Fred,et al.  Robust data clustering , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[3]  Brian Wharf,et al.  Community organizing : Canadian experiences , 1997 .

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

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

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

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

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

[9]  Arbee L. P. Chen,et al.  A Better Strategy of Discovering Link-Pattern Based Communities by Classical Clustering Methods , 2010, PAKDD.

[10]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

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

[12]  Tam'as Vicsek,et al.  Modularity measure of networks with overlapping communities , 2009, 0910.5072.

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

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

[15]  Philippa Pattison,et al.  Dynamic Social Network Modelling and Analysis , 2003 .

[16]  N. Economides.  The Economics of Networks , 1995 .

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

[18]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

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

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

[23]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

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

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

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

[27]  C O Dorso,et al.  Alternative approach to community detection in networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[30]  Chris H. Q. Ding,et al.  A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[31]  Edward Ott,et al.  Characterizing the dynamical importance of network nodes and links. , 2006, Physical review letters.

[32]  Huawei Shen,et al.  Quantifying and identifying the overlapping community structure in networks , 2009, 0905.2666.

[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]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[35]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

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

[37]  Natali Gulbahce,et al.  The art of community detection , 2008, BioEssays : news and reviews in molecular, cellular and developmental biology.

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

[39]  Joao Antonio Pereira,et al.  Linked: The new science of networks , 2002 .

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

[41]  Chung-Kuan Cheng,et al.  An improved two-way partitioning algorithm with stable performance [VLSI] , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[43]  Philip S. Yu,et al.  Community Learning by Graph Approximation , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

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

[45]  Ajay Mehra.  The Development of Social Network Analysis: A Study in the Sociology of Science , 2005 .

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

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

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