Graph Regularized Sparse Non-Negative Matrix Factorization for Clustering

The graph regularized nonnegative matrix factorization (GNMF) algorithms have received a lot of attention in the field of machine learning and data mining, as well as the square loss method is commonly used to measure the quality of reconstructed data. However, noise is introduced when data reconstruction is performed; and the square loss method is sensitive to noise, which leads to degradation in the performance of data analysis tasks. To solve this problem, a novel graph regularized sparse NMF (GSNMF) is proposed in this article. To obtain a cleaner data matrix to approximate the high-dimensional matrix, the $l_{1}$ -norm to the low-dimensional matrix is added to achieve the adjustment of data eigenvalues in the matrix and sparsity constraint. In addition, the corresponding inference and alternating iterative update algorithm to solve the optimization problem are given. Then, an extension of GSNMF, namely, graph regularized sparse nonnegative matrix trifactorization (GSNMTF), is proposed, and the detailed inference procedure is also shown. Finally, the experimental results on eight different datasets demonstrate that the proposed model has a good performance

Adjacency matrix · Algorithm · Cluster analysis · Dense graph · Eigenvalues and eigenvectors · Graph · Inference · Line graph · Matrix decomposition · Non-negative matrix factorization · Sparse matrix · Advanced Computing and Algorithms · Computer Science · Face and Expression Recognition · Mathematics · Sparse and Compressive Sensing Techniques · Artificial Intelligence · Theoretical Computer Science

• Enforced Block Diagonal Graph Learning for Multikernel Clustering

  Open Access•Xingfeng Li, Yinghui Sun et al.•IEEE Transactions on Computational…•2024

  Add to list

• Convex Optimization

  Open Access•Sally Boyd, Stephen Boyd et al.•Convex Optimization•2004

  Add to list