返回
Accelerated sparse nonnegative matrix factorization for unsupervised feature learning
DOI:10.1016/j.patrec.2022.01.020.png)
摘要
En 中文
Sparse Nonnegative Matrix Factorization (SNMF) is a fundamental unsupervised representation learning technique, and it represents low-dimensional features of a data set and lends itself to a clustering interpretation. However, the model and algorithm of SNMF have some shortcomings. In this work, we created a clustering method by improving the SNMF model and its Alternating Direction Multiplier Method acceleration algorithm. A novel, fast and closed-form iterative solution is proposed for SNMF with implicit sparse constraints which are L- 1 and L-2 norms of the coefficient and basis matrixes, respectively. A low-dimensional feature space is also proposed as result of the closed-form iteration formats of each sub-problem obtained by variable splitting. In addition, the convergence points of the presented iterative algorithms are stationary points of the model. Finally, numerical experiments show that the improved algorithm is comparable to the sate-of-the-art methods in data clustering. (C) 2022 Elsevier B.V. All rights reserved.
Keyword:
Nonnegative matrix factorization
Clustering
Sparse
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
Structured subspace learning-induced symmetric nonnegative matrix factorization
SIGNAL PROCESSING
IF3.6
Major and trace elements redistribution in weathered claystones from the Corumbataí Formation, Paraná Sedimentary Basin, São Paulo, Brazil巴西圣保罗巴拉那沉积盆地corumbata í 组风化的泥岩中主要和微量元素的重新分布
Quantitative Performance Evaluation of Uncertainty-Aware Hybrid AADL Designs Using Statistical Model Checking使用统计模型检查对不确定性感知的混合AADL设计进行定量性能评估

