Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

A review and comparative analysis of coarsening algorithms on bipartite networks

Full text
Author(s):
Valejo, Alan Demetrius Baria [1] ; de Oliveira dos Santos, Wellington [1] ; Naldi, Murilo Coelho [1] ; Zhao, Liang [2]
Total Authors: 4
Affiliation:
[1] Fed Univ Sao Carlos UFSCar, Dept Comp Sci, Sao Carlos, SP - Brazil
[2] Univ Sao Paulo, Dept Comp & Math DCM, FFCLRP, Ribeirao Preto, SP - Brazil
Total Affiliations: 2
Document type: Review article
Source: European Physical Journal-Special Topics; v. 230, n. 14-15, p. 2801-2811, OCT 2021.
Web of Science Citations: 1
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. (AU)

FAPESP's process: 19/09817-6 - Scalable descriptive models over extensive volumes of distributed data
Grantee:Murilo Coelho Naldi
Support Opportunities: Regular Research Grants
FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
Grantee:Francisco Louzada Neto
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 19/07665-4 - Center for Artificial Intelligence
Grantee:Fabio Gagliardi Cozman
Support Opportunities: Research Grants - Research Program in eScience and Data Science - Research Centers in Engineering Program
FAPESP's process: 15/50122-0 - Dynamic phenomena in complex networks: basics and applications
Grantee:Elbert Einstein Nehrer Macau
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 19/14429-5 - Visual analytics of heterogeneous brain networks using multilevel methods
Grantee:Alan Demétrius Baria Valejo
Support Opportunities: Scholarships in Brazil - Post-Doctoral