.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Non-negative matrix factorization
Geometry
Ill-posedness
Generative model
Component analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
ShareSaveShareSaveImproving non-negative matrix factorizations through structured initialization.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveFrom Single Cells to Tissues: Interactions between the Matrix and Human Breast Cells in Real TimePLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSave
View more