Sciweavers

Share
CORR
2008
Springer

Descent methods for Nonnegative Matrix Factorization

8 years 3 months ago
Descent methods for Nonnegative Matrix Factorization
In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method. We also give a comparison of these different methods and show that the new block coordinate method has better properties in terms of approximation error and complexity. By interpreting this method as a rank-one approximation of the residue matrix, we also extend it to the nonnegative tensor factorization and introduce some variants of the method by imposing some additional controllable constraints such as: sparsity, discreteness and smoothness.
Ngoc-Diep Ho, Paul Van Dooren, Vincent D. Blondel
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Ngoc-Diep Ho, Paul Van Dooren, Vincent D. Blondel
Comments (0)
books