Abstract
Several real-world data are represented as bipartite networks composed of two types of vertices, such as paper–author networks and event–attendee networks. Discovering communities from such bipartite networks is important for finding similar items and for understanding overall network structures. In order to evaluate the quality of divisions of normal (unipartite) networks, Newman’s modularity is widely used. Recently, modularities for bipartite networks are proposed by Guimera and Barber. These bipartite modularities are, however, not sufficient for evaluating the degree of correspondence between communities of different vertex types, which is often important for understanding the characteristics of the communities. For example, close-knit paper communities and author communities indicate that their research topics are relatively focused rather than loose-knit communities. This chapter proposes a new bipartite modularity for evaluating community extraction from bipartite networks. Experimental results show that our new bipartite modularity is appropriate for discovering close-knit communities, and it is also useful for characterizing the communities.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Barber, M.J. Modularity and community detection in bipartite networks. arXiv 0707.1616v3: 1–11, 2007.
Blondel, V.D., Guillaume, J.L., Lambiotte, and R., Lefebvre, E. Fast unfolding of community hierarchies in large networks. arXiv 0803.0476v1: 1–6, 2008.
Clauset, A., Newman, M.E.J., and Moore, C. Finding community structure in very large networks. Physical Review E, 70(066111): 1–6, 2004.
Danon, L., Diaz-Guilera, A., Duch, J., and Arenas, A. Comparing community structure identification. Journal of Statistical Mechanics, P09008: 1–10, 2005.
Dhillon, I.S. Co-clustering documents and words using bipartite spectral graph partitioning. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, pp. 269–274, 2001.
Fortunato, S. and Barthelemy, M. Resolution limit in community detection. In Proceedings of the National Academy of Sciences of the United States of America, 104(1): 36–41, 2007.
Guimera, R., Sales-Pardo, M., and Amaral, L.A.N. Module identification in bipartite and directed networks. Physical Review, 76(036102): 1–8, 2007.
Madeira, S.C. and Oliveira, A.L. Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1(1): 24–45, 2004.
Newman, M.E.J. Modularity and community structure in networks. In Proceedings of the National Academy of Sciences of the United States of America, 103: 8577–8582, 2006.
Newman, M.E.J. and Girvan, M. Finding and evaluating community structure in networks. Physical Review E, 69(026113): 1–15, 2004.
Sun, J., Qu, H., Chakrabarti, D., and Faloutsos, C. Neighborhood formation and anomaly detection in bipartite graphs. In Proceedings of the 5th IEEE International Conference on Data Mining, Houston, TX, pp. 418–425, 2005.
Tanay, A., Sharan, R., and Shamir, R. Discovering statistically significant biclusters in gene expression data. Bioinformatics, 18(Suppl.1): S136–S144, 2002.
Zhou, D., Orshanskiy, S.A., Zha, H., and Giles, C.L. Co-ranking authors and documents in a heterogeneous network. In Proceedings of the 7th IEEE International Conference on Data Mining, Omaha, NE, pp. 739–744, 2007.
Zhou, T., Ren, J., Medo, M., and Zhang, Y.C. Bipartite network projection and personal recommendation. Physical Review E, 76(046115): 1–7, 2007.
Acknowledgments
The author would like to thank Mr. Makoto Okamoto, Prof. Kikuo Maekawa (The National Institute for Japanese Language), and Prof. Sadaoki Furui (Tokyo Institute of Technology) for allowing us to use the data of Yahoo! Chiebukuro.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer US
About this chapter
Cite this chapter
Murata, T. (2010). Modularity for Bipartite Networks. In: Memon, N., Xu, J., Hicks, D., Chen, H. (eds) Data Mining for Social Network Data. Annals of Information Systems, vol 12. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6287-4_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6287-4_7
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6286-7
Online ISBN: 978-1-4419-6287-4
eBook Packages: Business and EconomicsBusiness and Management (R0)