Coarsening Algorithm Based on Multi-Label Propagation for Knowledge Discovery in Bipartite Networks

• Published in: IEEE transactions on network science and engineering Vol. 11; no. 2; pp. 1 - 11
• Main Authors: Valejo, Alan Demetrius Baria, Althoff, Paulo Eduardo, Faleiros, Thiago de Paulo, Filho, Geraldo Pereira Rocha, Zhu, Yu-tao, Yan, Jianglong, Liu, Weiguang, Zhao, Liang
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01-03-2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Bipartite networks; Coarsening; Cognitive tasks; Computer science; Convergence; Empirical analysis; Knowledge discovery; label propagation; Labels; Machine learning; Machine learning algorithms; multi-label propagation; multilevel approach; Networks; Oscillators; Propagation; Search problems; Task analysis; Task complexity
• ISSN: 2327-4697; 2334-329X
• DOI: 10.1109/TNSE.2023.3331655

Complex machine learning tasks for knowledge discovery in networked data, such as community detection, node categorization, network visualization, and dimension reduction, have been successfully addressed by coarsening algorithms. It iteratively reduces the original network into a hierarchy of smaller networks, resulting in informative simplifications of the original network at various degrees of detail. Few of these algorithms, however, have been specially built to cope with bipartite networks. Besides of this, current coarsening algorithms present the following theoretical limitations that should be addressed: 1) A high-cost search strategy in dense networks; 2) current coarsening algorithms are usually based on label propagation, which is limited to propagate single-labels; and 3) the synchronous label propagation scheme yields the cyclic oscillation problem. To overcome such limitations, we propose a coarsening algorithm based on multi-label propagation, which is more suitable for large-scale bipartite networks and allows a time-effective implementation. Furthermore, our proposal improves the standard semi-synchronous strategy and simultaneously propagates multiple labels to create the coarsened network representation. The empirical analysis of synthetic and real-world networks provides evidence that our coarsening strategy leads to significant gains regarding accuracy and runtime against standard techniques.