Sciweavers

287 search results - page 2 / 58
» Optimal Solutions for Sparse Principal Component Analysis
Sort
View
JMLR
2010
163views more  JMLR 2010»
13 years 5 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray
JMLR
2012
12 years 1 months ago
Sparse Higher-Order Principal Components Analysis
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
Genevera Allen
JACM
2011
152views more  JACM 2011»
13 years 1 months ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
CORR
2007
Springer
198views Education» more  CORR 2007»
13 years 10 months ago
Clustering and Feature Selection using Sparse Principal Component Analysis
In this paper, we study the application of sparse principal component analysis (PCA) to clustering and feature selection problems. Sparse PCA seeks sparse factors, or linear combi...
Ronny Luss, Alexandre d'Aspremont
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
13 years 1 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park