Non-negative matrix factorization

This is an old revision of this page, as edited by Fnielsen (talk | contribs) at 15:30, 3 February 2006 (Uniqueness). 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 above or equal to zero. It might be said to be a non-negative version of singular value decomposition.

It was used by a Finish 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 usefull algorithm.

Uniqueness

The factorization is not unique: A matrix and its inverse can be used to transform the two factorization matrix, 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.