Approximate Nonnegative Matrix Factorization via Alternating Minimization

Details Approximate Nonnegative Matrix Factorization via Alternating Minimization Approximate Nonnegative Matrix Factorization via Alternating Minimization

2004-02-13

arxiv.org/abs/math/0402229v1

Proceedings of the 16th International Symposium on Mathematical Theory of Networks and Systems, Leuven, July 5-9, 2004

Mathematics

Optimization and Control

Scientific paper

In this paper we consider the Nonnegative Matrix Factorization (NMF) problem: given an (elementwise) nonnegative matrix $V \in \R_+^{m\times n}$ find, for assigned $k$, nonnegative matrices $W\in\R_+^{m\times k}$ and $H\in\R_+^{k\times n}$ such that $V=WH$. Exact, non trivial, nonnegative factorizations do not always exist, hence it is interesting to pose the approximate NMF problem. The criterion which is commonly employed is I-divergence between nonnegative matrices. The problem becomes that of finding, for assigned $k$, the factorization $WH$ closest to $V$ in I-divergence. An iterative algorithm, EM like, for the construction of the best pair $(W, H)$ has been proposed in the literature. In this paper we interpret the algorithm as an alternating minimization procedure \`a la Csisz\'ar-Tusn\'ady and investigate some of its stability properties. NMF is widespreading as a data analysis method in applications for which the positivity constraint is relevant. There are other data analysis methods which impose some form of nonnegativity: we discuss here the connections between NMF and Archetypal Analysis. An interesting system theoretic application of NMF is to the problem of approximate realization of Hidden Markov Models.

Affiliated with

Also associated with

No associations

Rating

Approximate Nonnegative Matrix Factorization via Alternating Minimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximate Nonnegative Matrix Factorization via Alternating Minimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Nonnegative Matrix Factorization via Alternating Minimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-85505