Sciweavers

14 search results - page 1 / 3
» Compressed learning of high-dimensional sparse functions
Sort
View
NIPS
2008
13 years 6 months ago
Covariance Estimation for High Dimensional Data Vectors Using the Sparse Matrix Transform
Covariance estimation for high dimensional vectors is a classically difficult problem in statistical analysis and machine learning. In this paper, we propose a maximum likelihood ...
Guangzhi Cao, Charles A. Bouman
ICASSP
2011
IEEE
12 years 8 months ago
Compressed learning of high-dimensional sparse functions
This paper presents a simple randomised algorithm for recovering high-dimensional sparse functions, i.e. functions f : [0, 1]d → R which depend effectively only on k out of d va...
Karin Schnass, Jan Vybíral
ECCV
2010
Springer
13 years 9 months ago
Kernel Sparse Representation for Image Classification and Face Recognition
Recent research has shown the effectiveness of using sparse coding(Sc) to solve many computer vision problems. Motivated by the fact that kernel trick can capture the nonlinear sim...
JMLR
2008
133views more  JMLR 2008»
13 years 4 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
JMLR
2012
11 years 7 months ago
Sparse Additive Machine
We develop a high dimensional nonparametric classification method named sparse additive machine (SAM), which can be viewed as a functional version of support vector machine (SVM)...
Tuo Zhao, Han Liu