.png){kind=icon}
返回
Non-negative matrix factorization: Ill-posedness and a geometric algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2008.08.026.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Non-negative matrix factorization (NMF) has been proposed as a mathematical tool for identifying the components of a dataset. However, popular NMF algorithms tend to operate slowly and do not always identify the components which are most representative of the data. In this paper, an alternative algorithm for performing NMF is developed using the geometry of the problem. The computational costs of the algorithm are explored, and it is shown to successfully identify the components of a simulated dataset. The development of the geometric algorithm framework illustrates the ill-posedness of the NMF problem and suggests that NMF is not sufficiently constrained to be applied successfully outside of a particular class of problems. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Non-negative matrix factorization
Geometry
Ill-posedness
Generative model
Component analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
分享收藏Improving non-negative matrix factorizations through structured initialization.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏From Single Cells to Tissues: Interactions between the Matrix and Human Breast Cells in Real TimePLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容