Return
Adaptive graph nonnegative matrix factorization with the self-paced regularization
DOI:10.1007/s10489-022-04339-w.png)
Abstract
En 中文
Nonnegative matrix factorization (NMF) is a popular approach to extract intrinsic features from the original data. As the nonconvexity of NMF formulation, it always leads to degrade the performance. To alleviate the defect, in this paper, the self-paced regularization is introduced to find a better factorized matrices by sequentially selecteing data in the learning process. Additionally, to find the low-dimensional manifold embeded in the high-dimensional space, adaptive graph is introduced by using dynamic neighbors assignment. An alternating iterative algorithm is designed to sovle the proposed mathematical factorization formulation. The experimental results are given to show the effectiveness of the proposed approach in comparison with state-of-the-art algorithms on six public datasets.
Keywords:
Clustering
Nonnegative matrix factorization
Self-paced learning
Adaptive neighbors
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
Enhancing Hyperspectral Unmixing With Two-Stage Multiplicative Update Nonnegative Matrix Factorization
IEEE ACCESS
IF3.6
Regularized nonnegative matrix factorization with adaptive local structure learning
NEUROCOMPUTING
IF6.5
Graph regularized nonnegative matrix factorization with label discrimination for data clustering
NEUROCOMPUTING
IF6.5
Multi-view clustering via adversarial view embedding and adaptive view fusion
APPLIED INTELLIGENCE
IF3.5

