PUMA
Istituto di Ingegneria Biomedica     
Finesso L., Spreij P. Nonnegative matrix factorization and I-divergence alternating minimization. In: Linear Algebra and Its Applications, vol. 416 (2/3) pp. 270 - 87. Elsevier, 2006.
 
 
Abstract
(English)
In this paper we consider the Nonnegative Matrix Factorization (NMF) problem: given an (elementwise) nonnegative matrix V ? Rm×n+ find, for assigned k, nonnegative matrices W ? Rm×k+ and H ? Rk×n+ such that V = WH. Exact, nontrivial, 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 ŕ la Csiszár-Tusnády 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.
URL: http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0R-4J0WTR3-2&_user=6689734&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1063951764&_rerunOrigin=google&_acct=C000061181&_version=1&_urlVersion=0&_userid=6689734&md5=4bf58ca2
DOI: 10.1016/j.laa.2005.11.012
Subject Nonnegative matrix factorization
Approximate factorization
I-divergence
Alternating minimization
Lifting
Auxiliary function
Convergence


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional