Sciweavers

59 search results - page 10 / 12
» Sparse Higher-Order Principal Components Analysis
Sort
View
SIAMJO
2011
13 years 19 days ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
BMCV
2000
Springer
13 years 10 months ago
The Spectral Independent Components of Natural Scenes
Abstract. We apply independent component analysis (ICA) for learning an efficient color image representation of natural scenes. In the spectra of single pixels, the algorithm was a...
Te-Won Lee, Thomas Wachtler, Terrence J. Sejnowski
CVPR
2006
IEEE
14 years 8 months ago
Accelerated Kernel Feature Analysis
A fast algorithm, Accelerated Kernel Feature Analysis (AKFA), that discovers salient features evidenced in a sample of n unclassified patterns, is presented. Like earlier kernel-b...
Xianhua Jiang, Yuichi Motai, Robert R. Snapp, Xing...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 6 months ago
Robust Matrix Decomposition with Outliers
Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix (outliers), and the goal is to recover these individual components from th...
Daniel Hsu, Sham M. Kakade, Tong Zhang
NIPS
2008
13 years 7 months ago
Theory of matching pursuit
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...
Zakria Hussain, John Shawe-Taylor