Sciweavers

145 search results - page 1 / 29
» On Constrained Sparse Matrix Factorization
Sort
View
ICCV
2007
IEEE
14 years 6 months ago
On Constrained Sparse Matrix Factorization
Weishi Zheng, Stan Z. Li, Jian-Huang Lai, ShengCai...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
13 years 11 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
NIPS
2004
13 years 6 months ago
A Direct Formulation for Sparse PCA Using Semidefinite Programming
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
Alexandre d'Aspremont, Laurent El Ghaoui, Michael ...
ICASSP
2011
IEEE
12 years 8 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos
NIPS
2007
13 years 6 months ago
Probabilistic Matrix Factorization
Many existing approaches to collaborative filtering can neither handle very large datasets nor easily deal with users who have very few ratings. In this paper we present the Prob...
Ruslan Salakhutdinov, Andriy Mnih