Abstract
We investigate the problem of community detection in bipartite networks that are characterized by the presence of two types of nodes such that connections exist only between nodes of different types. While some approaches have been proposed to identify community structures in bipartite networks, there are a number of problems still to solve. In fact, the majority of the proposed approaches suffer from one or even more of the following limitations: (1) difficulty in detecting communities in the presence of many non-discriminating nodes with atypical connections that hide the community structures, (2) loss of relevant topological information due to the transformation of the bipartite network to standard plain graphs, and (3) manually specifying several input parameters, including the number of communities to be identified. To alleviate these problems, we propose BiNeTClus, a parameter-free community detection algorithm in bipartite networks that operates in two phases. The first phase focuses on identifying an initial grouping of nodes through a transactional data model capable of dealing with the situation that involves networks with many atypical connections, that is, sparsely connected nodes and nodes of one type that massively connect to all other nodes of the second type. The second phase aims to refine the clustering results of the first phase via an optimization strategy of the bipartite modularity to identify the final community structures. Our experiments on both synthetic and real networks illustrate the suitability of the proposed approach.
- Francesco Bonchi, Carlos Castillo, Aristides Gionis, and Alejandro Jaimes. 2011. Social network analysis and mining for business applications. ACM Trans. Intell. Syst. Technol. 2, 3, Article 22 (May 2011), 37 pages. DOI:http://dx.doi.org/10.1145/1961189.1961194Google ScholarDigital Library
- Jure Leskovec and Rok Sosič. 2016. SNAP: A general-purpose network analysis and graph-mining library. ACM Trans. Intell. Syst. Technol. 8, 1, Article 1 (July 2016), 20 pages. DOI:http://dx.doi.org/10.1145/2898361Google ScholarDigital Library
- Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008, 10 (2008), P10008.Google ScholarCross Ref
- Jaewon Yang and Jure Leskovec. 2014. Structure and overlaps of ground-truth communities in networks. ACM Trans. Intell. Syst. Technol. 5, 2, Article 26 (April 2014), 35 pages. DOI:http://dx.doi.org/10.1145/2594454Google ScholarDigital Library
- Taher Alzahrani and Kathy Horadam. 2016. Community detection in bipartite networks: Algorithms and case studies. In Complex Systems and Networks. Springer, 25--50.Google Scholar
- David Melamed. 2014. Community structures in bipartite networks: A dual-projection approach. PLoS One 9, 5 (2014), e97823.Google ScholarCross Ref
- Mark E. J. Newman. 2004. Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 6 (2004), 066133.Google ScholarCross Ref
- Pascal Pons and Matthieu Latapy. 2005. Computing communities in large networks using random walks. In Proceedings of the International Symposium on Computer and Information Sciences. Springer, 284--293.Google ScholarDigital Library
- Usha Nandini Raghavan, Réka Albert, and Soundar Kumara. 2007. Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76, 3 (2007), 036106.Google ScholarCross Ref
- Michael J. Barber. 2007. Modularity and community detection in bipartite networks. Phys. Rev. E 76, 6 (2007), 066102.Google ScholarCross Ref
- Xin Liu and Tsuyoshi Murata. 2010. Community detection in large-scale bipartite networks. Inf. Media Technol. 5, 1 (2010), 184--192.Google Scholar
- Xin Liu and Tsuyoshi Murata. 2010. An efficient algorithm for optimizing bipartite modularity in bipartite networks. J. Adv. Comput. Intell. Intell. Inf. 14, 4 (2010), 408--415.Google ScholarCross Ref
- Tsuyoshi Murata. 2009. Detecting communities from bipartite networks based on bipartite modularities. In Proceedings of the International Conference on Computational Science and Engineering (CSE’09), Vol. 4. IEEE, 50--57.Google ScholarDigital Library
- Paola Gabriela Pesantez and Ananth Kalyanaraman. 2019. Efficient detection of communities in biological bipartite networks. IEEE/ACM Trans. Comput. Biol. Bioinf. 16, 1 (2019), 258--271.Google ScholarDigital Library
- Michael J. Barber and John W. Clark. 2009. Detecting network communities by propagating labels under constraints. Phys. Rev. E 80, 2 (2009), 026129.Google ScholarCross Ref
- Daniel B. Larremore, Aaron Clauset, and Abigail Z. Jacobs. 2014. Efficiently inferring community structure in bipartite networks. Phys. Rev. E 90, 1 (2014), 012805.Google ScholarCross Ref
- Kenta Suzuki and Ken Wakita. 2009. Extracting multi-facet community structure from bipartite networks. In Proceedings of the International Conference on Computational Science and Engineering (CSE’09), Vol. 4. IEEE, 312--319.Google ScholarDigital Library
- Philipp Schuetz and Amedeo Caflisch. 2008. Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Phys. Rev. E 77, 4 (2008), 046112.Google ScholarCross Ref
- Philipp Schuetz and Amedeo Caflisch. 2008. Multistep greedy algorithm identifies community structure in real-world and computer-generated networks. Phys. Rev. E 78, 2 (2008), 026112.Google ScholarCross Ref
- Brian Karrer and Mark E. J. Newman. 2011. Stochastic blockmodels and community structure in networks. Phys. Rev. E 83, 1 (2011), 016107.Google ScholarCross Ref
- Ulrik Brandes and Thomas Erlebach. 2005. Network Analysis: Methodological Foundation. Springer-Verlag Berlin Heidelberg.Google ScholarCross Ref
- Yongcheng Xu and Ling Chen. 2014. Modularity density for evaluating community structure in bipartite networks. Open Autom. Contr. Syst. J. 6 (2014), 684--691.Google ScholarCross Ref
- Mark E. J. Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Phys. Rev. E 69, 2 (2004), 026113.Google ScholarCross Ref
- Thomas S. Rask, Daniel A. Hansen, Thor G. Theander, Anders Gorm Pedersen, and Thomas Lavstsen. 2010. Plasmodium falciparum erythrocyte membrane protein 1 diversity in seven genomes–divide and conquer. PLoS Comput. Biol. 6, 9 (2010), e1000933.Google ScholarCross Ref
- Peter C. Bull, Caroline O. Buckee, Sue Kyes, Moses M. Kortok, Vandana Thathy, Bernard Guyah, José A. Stoute, Chris I. Newbold, and Kevin Marsh. 2008. Plasmodium falciparum antigenic variation. Mapping mosaic var gene sequences onto a network of shared, highly polymorphic sequence blocks. Molec. Microbiol. 68, 6 (2008), 1519--1534.Google ScholarCross Ref
- Li Chong, Kunyang Jia, Dan Shen, C. J. Richard Shi, and Hongxia Yang. 2019. Hierarchical representation learning for bipartite graphs. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI’19). 2873--2879.Google Scholar
- Chih-Ming Chen, Chuan-Ju Wang, Ming-Feng Tsai, and Yi-Hsuan Yang. 2019. Collaborative similarity embedding for recommender systems. In Proceedings of the World Wide Web Conference (WWW’19). 2637--2643.Google ScholarDigital Library
- Zhang Yao, Yun Xiong, Xiangnan Kong, and Yangyong Zhu. 2017. Learning node embeddings in interaction graphs. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM’17). 397--406.Google Scholar
Index Terms
BiNeTClus: Bipartite Network Community Detection Based on Transactional Clustering
Recommendations
Community Detection in Large-Scale Bipartite Networks
WI-IAT '09: Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01Community detection in networks receives much attention recently. Most of the previous works are for unipartite networks composed of only one type of nodes. In real world situations, however, there are many bipartite networks composed of two types of ...
Overlapping Community Detection in Bipartite Networks
WI-IAT '08: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01Recent researches have discovered that rich interactions among entities in nature and human society bring about complex networks with community structures. In this paper, we propose a novel algorithm BiTector (Bi-community DeTector) to mine the ...
k-Dense communities in the Internet AS-level topology graph
In this paper we investigate the structure of the Internet by exploiting an efficient algorithm for extracting k-dense communities from the Internet AS-level topology graph. The analyses showed that the most well-connected communities consist of a small ...
Comments