Algorithms for Non-negative Matrix Factorization


Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multi-plicative 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 Expectation-Maximization 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

Showing 1-10 of 13 references

Least squares formulation of robust non-negative factor analysis

  • P Paatero, Tapper
  • 1997
1 Excerpt

What is the goal of sensory coding? Neural Comput

  • Dj Field
  • 1994
1 Excerpt

Vector Quantization and Signal Compression

  • A Gersho, Rm Gray
  • 1992
1 Excerpt
Showing 1-10 of 2,626 extracted citations
Citations per Year

5,570 Citations

Semantic Scholar estimates that this publication has received between 5,167 and 6,002 citations based on the available data.

See our FAQ for additional information.