Sciweavers

561 search results - page 8 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 7 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
ICIP
2009
IEEE
14 years 8 months ago
Facial Expression Recognition Based On Graph-preserving Sparse Non-negative Matrix Factorization
In this paper, we present a novel algorithm for representing facial expressions. The algorithm is based on the non-negative matrix factorization (NMF) algorithm, which decomposes ...
FLAIRS
2010
13 years 9 months ago
Correlating Shape and Functional Properties Using Decomposition Approaches
In this paper, we propose the application of standard decomposition approaches to find local correlations in multimodal data. In a test scenario, we apply these methods to correla...
Daniel Dornbusch, Robert Haschke, Stefan Menzel, H...
JMLR
2010
195views more  JMLR 2010»
13 years 5 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...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 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 als...
Ngoc-Diep Ho, Paul Van Dooren, Vincent D. Blondel