EUVIMEDObjevte EUVIMED
Open access · CC BY 4.0

Convex Nonnegative Matrix Factorization on Bipartite Graph

Pengfei Zhang

计算机科学辑要 · 2025

DOI: 10.63313/cs.8008 ↗

At a glance

Journal article in 计算机科学辑要, 2025. Written by Pengfei Zhang. 26 references. The full text is freely available (open access, CC BY 4.0).

AbstraktBibliografické údajeCiteRelated studies

Abstract (original language)

In this paper, we propose a novel convex nonnegative matrix factorization (CNMF) method to learn a bipartite graph with exactly k connected compo-nents, where k is the number of clusters. The new bipartite graph learned in our model approximates the original graph but maintains an explicit cluster struc-ture, from which we can immediately get the clustering results. Besides, inspired by self-expressive assumption of the data and subspace clustering, we added ad-ditional constraints to further recover global structural information of the data. Multiplicative updating rules are developed. The superiority of our method over the effectiveness and efficiency is demonstrated by extensive experiments.

Cite

APA

Zhang, P. (2025). Convex Nonnegative Matrix Factorization on Bipartite Graph. 计算机科学辑要. https://doi.org/10.63313/cs.8008

Vancouver

Zhang P. Convex Nonnegative Matrix Factorization on Bipartite Graph. 计算机科学辑要. 2025. doi:10.63313/cs.8008

BibTeX
@article{Zhang2025,
  author = {Zhang, Pengfei},
  title = {Convex Nonnegative Matrix Factorization on Bipartite Graph},
  journal = {计算机科学辑要},
  year = {2025},
  doi = {10.63313/cs.8008}
}
Start for free →