Fast Global and Local Semi-Supervised Learning via Matrix Factorization

Yuanhua Du, Wenjun Luo (), Zezhong Wu and Nan Zhou
Additional contact information
Yuanhua Du: College of Applied Mathematics, Chengdu University of Information Technology, Chengdu 610225, China
Wenjun Luo: College of Applied Mathematics, Chengdu University of Information Technology, Chengdu 610225, China
Zezhong Wu: College of Applied Mathematics, Chengdu University of Information Technology, Chengdu 610225, China
Nan Zhou: School of Electronic Information and Electrical Engineering, Chengdu University, Chengdu 610225, China

Mathematics, 2024, vol. 12, issue 20, 1-20

Abstract: Matrix factorization has demonstrated outstanding performance in machine learning. Recently, graph-based matrix factorization has gained widespread attention. However, graph-based methods are only suitable for handling small amounts of data. This paper proposes a fast semi-supervised learning method using only matrix factorization, which considers both global and local information. By introducing bipartite graphs into symmetric matrix factorization, the technique can handle large datasets effectively. It is worth noting that by utilizing tag information, the proposed symmetric matrix factorization becomes convex and unconstrained, i.e., the non-convex problem min x ( 1 − x 2 ) 2 is transformed into a convex problem. This allows it to be optimized quickly using state-of-the-art unconstrained optimization algorithms. The computational complexity of the proposed method is O ( n m d ) , which is much lower than that of the original symmetric matrix factorization, which is O ( n 2 d ) , and even lower than that of other anchor-based methods, which is O ( n m d + m 2 n + m 3 ) , where n represents the number of samples, d represents the number of features, and m ≪ n represents the number of anchors. The experimental results on multiple public datasets indicate that the proposed method achieves higher performance in less time.

Keywords: matrix factorization; bipartite graph; semi-supervised learning; clustering (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/20/3242/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/20/3242/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:20:p:3242-:d:1500257

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().