.png){kind=icon}
.png){kind=icon}
Return
An alternating projected gradient algorithm for nonnegative matrix factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2011.04.070.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to the extensive applications of nonnegative matrix factorizations (NMFs) of nonnegative matrices, such as in image processing, text mining, spectral data analysis, speech processing, etc., algorithms for NMF have been studied for years. In this paper, we propose a new algorithm for NMF, which is based on an alternating projected gradient (APG) approach. In particular, no zero entries appear in denominators in our algorithm which implies no breakdown occurs, and even if some zero entries appear in numerators new updates can always be improved in our algorithm. It is shown that the effect of our algorithm is better than that of Lee and Seung's algorithm when we do numerical experiments on two known facial databases and one iris database. (C) 2011 Elsevier Inc. All rights reserved.
Keywords:
Nonnegative matrix factorization
Projected gradient algorithm
Multiplicative updating method
Low-rank decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W