返回
Sparse nonnegative matrix factorization with l0-constraints
DOI:10.1016/j.neucom.2011.09.024.png)
摘要
En 中文
Although nonnegative matrix factorization (NMF) favors a sparse and part-based representation of nonnegative data, there is no guarantee for this behavior. Several authors proposed NMF methods which enforce sparseness by constraining or penalizing the l(1)-norm of the factor matrices. On the other hand, little work has been done using a more natural sparseness measure, the l(0)-pseudo-norm. In this paper, we propose a framework for approximate NMF which constrains the l(0)-norm of the basis matrix, or the coefficient matrix, respectively. For this purpose, techniques for unconstrained NMF can be easily incorporated, such as multiplicative update rules, or the alternating nonnegative least-squares scheme. In experiments we demonstrate the benefits of our methods, which compare to, or outperform existing approaches. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
NMF
Sparse coding
Nonnegative least squares
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
A micromachined efficient parametric array loudspeaker with a wide radiation frequency band具有宽辐射频带的微机械高效参量阵列扬声器
Influence of roofing materials and lead flashing on rainwater tank contamination by metals屋面材料和铅防水板对金属污染雨水箱的影响
Exploring the Exhaust Emission and Efficiency of Algal Biodiesel Powered Compression Ignition Engine: Application of Box–Behnken and Desirability Based Multi-Objective Response Surface Methodology
Energies
IF0

