225 search results - page 18 / 45 » Kernel Basis Pursuit |
NIPS
2008
13 years 11 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
ICPR
2004
IEEE
14 years 11 months ago
2004
IEEE
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
ICIP
2008
IEEE
14 years 4 months ago
2008
IEEE
In this work, we propose the use of sparse signal representation techniques to solve the problem of closed-loop spatial image prediction. The reconstruction of signal in the block...
SIAMSC
2008
13 years 9 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
JMLR
2010
13 years 4 months ago
2010
We introduce a new method -- the group Dantzig selector -- for high dimensional sparse regression with group structure, which has a convincing theory about why utilizing the group...