Non-negative matrix factorization

This is an old revision of this page, as edited by Fnielsen (talk | contribs) at 12:04, 20 June 2006 (More information from Dhillon's paper.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Non-negative matrix factorization (NMF) is a group of algorithms in multivariate analysis and linear algebra where a matrix is factorized into (usually) two matrices

Usually all three matrices must be non-negative, i.e., all elements must be equal to or greater than zero. It might be said to be a sort of non-negative version of singular value decomposition. Usually the numbers of columns of W and the numbers of rows of H is selected so the product WH will become an approximation to X, and it has been suggested that the NMF model should be called nonnegative matrix approximation instead.

It was used by a Finnish group of researchers in the middle of the 1990s under the name positive matrix factorization. It became more widely known after Lee and Seung's investigations of the properties of the algorithm, and after they published a simple useful algorithm.

There are different types of non-negative matrix factorizations and one of these is related to probabilistic latent semantic analysis and the latent class model. They different types arise from using different cost functions (divergence functions) and/or by regularization of the W and/or H matrices[1].

Uniqueness

The factorization is not unique: A matrix and its inverse can be used to transform the two factorization matrices by, e.g.,

 

If the two new matrices   and   are non-negative they form another parametrization of the factorization.

The non-negativity of   and   applies at least if B is a non-negative monomial matrix. In this simple case it will just correspond to a scaling and a permutation.

References