.png){kind=icon}
返回
Adaptive Method for Nonsmooth Nonnegative Matrix Factorization
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2016.2517096.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nonnegative matrix factorization (NMF) is an emerging tool for meaningful low-rank matrix representation. In NMF, explicit constraints are usually required, such that NMF generates desired products (or factorizations), especially when the products have significant sparseness features. It is known that the ability of NMF in learning sparse representation can be improved by embedding a smoothness factor between the products. Motivated by this result, we propose an adaptive nonsmooth NMF (Ans-NMF) method in this paper. In our method, the embedded factor is obtained by using a data-related approach, so it matches well with the underlying products, implying a superior faithfulness of the representations. Besides, due to the usage of an adaptive selection scheme to this factor, the sparseness of the products can be separately constrained, leading to wider applicability and interpretability. Furthermore, since the adaptive selection scheme is processed through solving a series of typical linear programming problems, it can be easily implemented. Simulations using computer-generated data and real-world data show the advantages of the proposed Ans-NMF method over the state-of-the-art methods.
Keyword:
Linear programming (LP)
nonnegative matrix factorization (NMF)
smoothness constraint
sparse representation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
.png){kind=icon}
分享收藏Automated Graph Regularized Projective Nonnegative Matrix Factorization for Document Clustering用于文档聚类的自动图正则化投影非负矩阵分解
PREAI
分享收藏Two Efficient Algorithms for Approximately Orthogonal Nonnegative Matrix Factorization近似正交非负矩阵分解的两种有效算法
PREAI
分享收藏分享收藏
查看更多内容