返回
Structured Sparse Non-Negative Matrix Factorization With l2,0-Norm
DOI:10.1109/TKDE.2022.3206881.png)
摘要
En 中文
Non-negativematrix factorization (NMF) is a powerful tool for dimensionality reduction and clustering. However, the interpretation of the clustering result from NMF is difficult, especially for the high-dimensional biological data without effective feature selection. To address this problem, we introduce a row-sparse NMF with l(2,0)-norm constraint (NMF_l(20)), where the basis matrix W is constrained by using the l(2,0)-norm constraint such that W has a row-sparsity pattern with feature selection. However, it is a challenge to solve the model, because the l(2,0)-norm constraint is a non-convex and non-smooth function. Fortunately, we prove that the l(2,0)-norm constraint satisfies the Kurdyka-Lojasiewicz property. Based on this finding, we present a proximal alternating linearized minimization algorithm and its monotone accelerated version to solve the NMF_l(20) model. In addition, we further present a orthogonal NMF with (2,0)-norm constraint (ONMF_l(20)) to enhance the clustering performance by using a non-negative orthogonal constraint. The ONMF_l(20) model is solved by transforming into a series of constrained and penalized matrix factorization problems. The convergence and guarantees for these proposed algorithms are proved and the computational complexity is well evaluated. The results on numerical and scRNA-seq datasets demonstrate the efficiency of our methods in comparison with existing methods.
Keyword:
l(2,0)-norm
feature selection
row-sparse NMF and ONMF
non-convex optimization
scRNA-seq data clustering
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Integrative analysis of single-cell genomics data by coupled nonnegative matrix factorizations通过耦合非负矩阵分解对单细胞基因组学数据进行综合分析
Quantitative Performance Evaluation of Uncertainty-Aware Hybrid AADL Designs Using Statistical Model Checking使用统计模型检查对不确定性感知的混合AADL设计进行定量性能评估

