Sciweavers

159 search results - page 13 / 32
» Sparse non-Gaussian component analysis
Sort
View
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 6 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
NIPS
2008
13 years 10 months ago
Sparse probabilistic projections
We present a generative model for performing sparse probabilistic projections, which includes sparse principal component analysis and sparse canonical correlation analysis as spec...
Cédric Archambeau, Francis Bach
NIPS
2007
13 years 10 months ago
Sparse Overcomplete Latent Variable Decomposition of Counts Data
An important problem in many fields is the analysis of counts data to extract meaningful latent components. Methods like Probabilistic Latent Semantic Analysis (PLSA) and Latent ...
Madhusudana V. S. Shashanka, Bhiksha Raj, Paris Sm...
SIAMJO
2011
13 years 3 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
JACM
2011
152views more  JACM 2011»
12 years 11 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...