.png){kind=icon}
返回
Efficient Nonnegative Matrix Factorization via projected Newton method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2012.02.037.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nonnegative Matrix Factorization (NMF) is a popular decomposition technique in pattern analysis, document clustering, image processing and related fields. In this paper, we propose a fast NMF algorithm via Projected Newton Method (PNM). First, we propose PNM to efficiently solve a nonnegative least squares problem, which achieves a quadratic convergence rate under appropriate assumptions. Second, in the framework of an alternating optimization method, we adopt PNM as an essential subroutine to efficiently solve the NMF problem. Moreover, by exploiting the low rank assumption of NMF, we make PNM very suitable for solving NMF efficiently. Empirical studies on both synthetic and real-world (text and image) data demonstrate that PNM is quite efficient to solve NMF compared with several state of the art algorithms. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Nonnegative Matrix Factorization
Projected Newton method
Quadratic convergence rate
Nonnegative least squares
Low rank
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
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
分享收藏分享收藏
查看更多内容