返回
Adaptive graph nonnegative matrix factorization with the self-paced regularization
DOI:10.1007/s10489-022-04339-w.png)
摘要
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.
Keyword:
Clustering
Nonnegative matrix factorization
Self-paced learning
Adaptive neighbors
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Enhancing Hyperspectral Unmixing With Two-Stage Multiplicative Update Nonnegative Matrix Factorization两阶段乘法更新非负矩阵分解增强高光谱解混
IEEE ACCESS
IF3.6
Characterization of single crystal chemical vapor deposition diamond detectors for neutron spectrometry单晶化学气相沉积金刚石探测器在快中子能谱测量中的表征
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

