225 search results - page 1 / 45 » Kernel Basis Pursuit |
ECML
2005
Springer
13 years 10 months ago
2005
Springer
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...
ICMLA
2009
13 years 2 months ago
2009
This paper introduces a new algorithm, namely the EquiCorrelation Network (ECON), to perform supervised classification, and regression. ECON is a kernelized LARS-like algorithm, b...
PKDD
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
ML
2002
ACM
13 years 4 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper presents a novel method for reducing the dimensionality of kernel spaces. Recently, to maintain the convexity of training, loglinear models without mixtures have been u...