Sciweavers

159 search results - page 24 / 32
» Sparse non-Gaussian component analysis
Sort
View
CSDA
2008
80views more  CSDA 2008»
13 years 8 months ago
Variational Bayesian functional PCA
A Bayesian approach to analyze the modes of variation in a set of curves is suggested. It is based on a generative model thus allowing for noisy and sparse observations of curves....
Angelika van der Linde
KDD
2001
ACM
187views Data Mining» more  KDD 2001»
14 years 9 months ago
Random projection in dimensionality reduction: applications to image and text data
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
Ella Bingham, Heikki Mannila
ICASSP
2010
IEEE
13 years 3 months ago
Temporally constrained SCA with applications to EEG data
In this paper we propose an iterative algorithm for solving the problem of extracting a sparse source signal when a reference signal for the desired source signal is available. In...
Nasser Mourad, James P. Reilly, Gary Hasey, Duncan...
DAS
2006
Springer
14 years 7 days ago
Finding the Best-Fit Bounding-Boxes
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding...
Bo Yuan, Leong Kwoh, Chew Lim Tan
SIAMJO
2011
12 years 11 months ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...