Algorithms for Non-negative Matrix Factorization

Abstract

Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown to minimize the conventional least squares error while the other minimizes the generalized Kullback-Leibler divergence. The monotonic convergence of both algorithms can be proven using an auxiliary function analogous to that used for proving convergence of the ExpectationMaximization algorithm. The algorithms can also be interpreted as diagonally rescaled gradient descent, where the rescaling factor is optimally chosen to ensure convergence.

Extracted Key Phrases

1 Figure or Table

0200400600'01'03'05'07'09'11'13'15'17
Citations per Year

5,295 Citations

Semantic Scholar estimates that this publication has 5,295 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Lee2000AlgorithmsFN, title={Algorithms for Non-negative Matrix Factorization}, author={Daniel D. Lee and H. Sebastian Seung}, booktitle={NIPS}, year={2000} }