Sciweavers

477 search results - page 7 / 96
» Algorithms for Non-negative Matrix Factorization
Sort
View
ICML
2003
IEEE
14 years 8 months ago
Adaptive Overrelaxed Bound Optimization Methods
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
Ruslan Salakhutdinov, Sam T. Roweis
CORR
2002
Springer
180views Education» more  CORR 2002»
13 years 7 months ago
Non-negative sparse coding
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
Patrik O. Hoyer
JMLR
2010
195views more  JMLR 2010»
13 years 6 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
ECCV
2006
Springer
14 years 9 months ago
Controlling Sparseness in Non-negative Tensor Factorization
Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of t...
Matthias Heiler, Christoph Schnörr
ICASSP
2009
IEEE
13 years 11 months ago
A tempering approach for Itakura-Saito non-negative matrix factorization. With application to music transcription
In this paper we are interested in non-negative matrix factorization (NMF) with the Itakura-Saito (IS) divergence. Previous work has demonstrated the relevance of this cost functi...
Nancy Bertin, Cédric Févotte, Roland...