Abstract
Coarsening algorithms have been successfully used as a powerful strategy to deal with data-intensive machine learning problems defined in bipartite networks, such as clustering, dimensionality reduction, and visualization. Their main goal is to build informative simplifications of the original network at different levels of details. Despite its widespread relevance, a comparative analysis of these algorithms and performance evaluation is needed. Additionally, some aspects of these algorithms’ current versions have not been explored in their original or complementary studies. In that regard, we strive to fill this gap, presenting a formal and illustrative description of coarsening algorithms developed for bipartite networks. Afterward, we illustrate the usage of these algorithms in a set of emblematic problems. Finally, we evaluate and quantify their accuracy using quality and runtime measures in a set of thousands of synthetic and real-world networks with various properties and structures. The presented empirical analysis provides evidence to assess the strengths and shortcomings of such algorithms. Our study is a unified and useful resource that provides guidelines to researchers interested in learning about and applying these algorithms.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Data Availability Statement
My manuscript has no associated data or the data will not be deposited.
References
T.P. de Faleiros, R.G. Rossi, A.A. Lopes, Optimizing the class information divergence for transductive classification of texts using propagation in bipartite graphs. Pattern Recognit. Lett. 87, 127–138 (2017)
T. Hwang, H. Sicotte, Z. Tian, W. Baolin, J.-P. Kocher, D.A. Wigle, V. Kumar, R. Kuang, Robust and efficient identification of biomarkers by classifying features on graphs. Bioinformatics 24(18), 2023–2029 (2008)
J. Grujić, Movies recommendation networks as bipartite graphs. In: Proceedings of the international conference on computational science (ICCS)
A. Valejo, V. Ferreira, M.C.F. Oliveira, A.A. Lopes, Community detection in bipartite network: a modified coarsening approach. In: International symposium on information management and big data (SIMBig), track on SNMAN. Communications in computer and information science book series (CCIS, vol. 795)
T. Faleiros, A. Valejo, A.A. de Lopes, Unsupervised learning of textual pattern based on propagation in bipartite graph. Intell. Data Anal. 24(3), 543–565 (2020)
A. Valejo, T.P. Faleiros, M.C.F. Oliveira, A. Lopes, A coarsening method for bipartite networks via weight-constrained label propagation. Knowl. Based Syst. 195, 105678 (2020)
D. Minatel, A. Valejo, A.A. Lopes, Trajectory network assessment based on analysis of stay points cluster. In: Brazilian conference on intelligent systems (BRACIS) (2018), pp. 564–569
A. Valejo, M.C.G. Oliveira, G.P.R. Filho, A.A. Lopes, Multilevel approach for combinatorial optimization in bipartite network. Knowl. Based Syst. 151, 45–61 (2018)
Alan Valejo, V. Ferreira, R. Fabbri, M.C.F. Oliveira, A. Lopes, A critical survey of the multilevel method in complex networks. ACM Comput. Surv. 53(2), 35 (2020)
A. Rawashdeh, A.L. Ralescu, Similarity measure for social networks-a brief survey. In: Modern AI and cognitive science conference (MAICS)
A. Valejo, J. Valverde-Rebaza, B. Drury, A.A. De Lopes, Multilevel refinement based on neighborhood similarity. In: International database engineering and applications symposium (IDEAS)
A. Valejo, A.A. Lopes, G.P.R. Filho, M.C.F. Oliveira, V. Ferreira, One-mode projection-based multilevel approach for community detection in bipartite networks. In: International symposium on information management and big data (SIMBig), track on social network and media analysis and mining (SNMAN) (2017), pp. 101–108
G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1998)
M. Kitsak, D. Krioukov, Hidden variables in bipartite networks. Phys. Rev. E 84(2), 026114 (2011)
M. Kitsak, F. Papadopoulos, D. Krioukov, Latent geometry of bipartite networks. Phys. Rev. E 95, 032309 (2017)
U.N. Raghavan, R. Albert, S. Kumara, Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76, 036106 (2007)
L. Linyuan, T. Zhou, Link prediction in weighted networks: the role of weak ties. Europhys. Lett. 89(1), 18001 (2010)
S.P. Borgatti, D.S. Halgin, Analyzing affiliation networks. Sage Handb. Soc. Netw. Anal. 1, 417–433 (2011)
S. Banerjee, M. Jenamani, D.K. Pratihar, Properties of a projected network of a bipartite network. In: 2017 International conference on communication and signal processing (ICCSP) (IEEE, 2017), pp. 0143–0147
S. Fortunato, Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
C. Walshaw, M.G. Everett, Multilevel landscapes in combinatorial optimisation. Technical report, Computing and Mathematical Sciences, University of Greenwich (2002)
J. Díaz, J. Petit, M. Serna, A survey of graph layout problems. ACM Comput. Survey 34(3), 313–356 (2000)
T. von Landesberger, A. Kuijper, T. Schreck, J. Kohlhammer, J.J. van Wijk, J.-D. Fekete, D.W. Fellner, Visual analysis of large graphs: state-of-the-art and future research challenges. Comput. Graph. Forum 30(6), 1719–1749 (2011)
T.M.J. Fruchterman, E.M. Reingold, Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129–1164 (1991)
L. Danon, A. Diaz-Guilera, J. Duch, A. Arenas, Comparing community structure identification. J. Stat. Mech. Theory Exp. 2005(09), P09008 (2005)
T. Murata, Modularities for bipartite networks. In: Proceedings of the 20th ACM conference on hypertext and hypermedia (2009), pp. 245–250
J. Demšar, Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1–30 (2006)
A. Valejo, F. Goes, L.M. Romanetto, M.C.F. Oliveira, A.A. Lopes, A benchmarking tool for the generation of bipartite network models with overlapping communities. Knowl. Inf. Syst. 62, 1641–1669 (2019)
J. Kunegis, Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on World Wide Web (2013), pp. 1343–1350
G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1998)
B.F. Auer, R.H. Bisseling, Graph coarsening and clustering on the GPU. Graph Partit. Graph Clust. 588, 223 (2012)
Acknowledgements
This research was funded by the State of São Paulo Research Foundation (FAPESP) grants 2013/07375-0, 15/50122-0, 2019/09817-6, 19/07665-4 and 2019/14429-5; the Brazilian Federal Research Council (CNPq) grant 303199/2019-9; the C4AI grant FAPESP/IBM/USP: 2019/07665-4, the German Research Foundation (DFG) (Project IRTG/GRK 1740), and the Ministry of Science and Technology of China grant G20200226016.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Valejo, A.D.B., de Oliveira dos Santos, W., Naldi, M.C. et al. A review and comparative analysis of coarsening algorithms on bipartite networks. Eur. Phys. J. Spec. Top. 230, 2801–2811 (2021). https://doi.org/10.1140/epjs/s11734-021-00159-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1140/epjs/s11734-021-00159-0