Sciweavers

16 search results - page 3 / 4
» Block Householder computation of sparse matrix singular valu...
Sort
View
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 8 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
SLSFS
2005
Springer
13 years 11 months ago
Incorporating Constraints and Prior Knowledge into Factorization Algorithms - An Application to 3D Recovery
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...
Amit Gruber, Yair Weiss
CVPR
2011
IEEE
13 years 1 months ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan
BMCBI
2010
144views more  BMCBI 2010»
13 years 5 months ago
Super-sparse principal component analyses for high-throughput genomic data
Background: Principal component analysis (PCA) has gained popularity as a method for the analysis of highdimensional genomic data. However, it is often difficult to interpret the ...
Donghwan Lee, Woojoo Lee, Youngjo Lee, Yudi Pawita...
BMCBI
2010
216views more  BMCBI 2010»
13 years 24 days ago
Bayesian Inference of the Number of Factors in Gene-Expression Analysis: Application to Human Virus Challenge Studies
Background: Nonparametric Bayesian techniques have been developed recently to extend the sophistication of factor models, allowing one to infer the number of appropriate factors f...
Bo Chen, Minhua Chen, John William Paisley, Aimee ...