.png){kind=icon}
返回
Using underapproximations for sparse nonnegative matrix factorization
.png){kind=icon}
OA
AI
DOI：10.1016/j.patcog.2009.11.013.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nonnegative matrix factorization consists in (approximately) factorizing a nonnegative data matrix by the product of two low-rank nonnegative matrices. It has been successfully applied as a data analysis technique in numerous domains, e.g., text mining, image processing, microarray data analysis, collaborative filtering, etc. We introduce a novel approach to solve NMF problems, based on the use of an underapproximation technique, and show its effectiveness to obtain sparse solutions. This approach, based on Lagrangian relaxation, allows the resolution of NMF problems in a recursive fashion. We also prove that the underapproximation problem is NP-hard for any fixed factorization rank, using a reduction of the maximum edge biclique problem in bipartite graphs. We test two variants of our underapproximation approach on several standard image datasets and show that they provide sparse part-based representations with low reconstruction error. Our results are comparable and sometimes superior to those obtained by two standard sparse nonnegative matrix factorization techniques. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Nonnegative matrix factorization
Underapproximation
Maximum edge biclique problem
Sparsity
Image processing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
Quantitative Performance Evaluation of Uncertainty-Aware Hybrid AADL Designs Using Statistical Model Checking使用统计模型检查对不确定性感知的混合AADL设计进行定量性能评估OAAI
OAAI分享收藏Physiological Arousal of Beginning Counselors In Relation To Disabled And Non-Disabled Clients与残疾和非残疾客户有关的初级辅导员的生理唤醒
PREAI
分享收藏Influence of roofing materials and lead flashing on rainwater tank contamination by metals屋面材料和铅防水板对金属污染雨水箱的影响
PREAI
分享收藏
查看更多内容