Sciweavers

137 search results - page 1 / 28
» A Direct Method for Building Sparse Kernel Learning Algorith...
Sort
View
JMLR
2006
124views more  JMLR 2006»
13 years 4 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
ICML
2005
IEEE
14 years 5 months ago
Building Sparse Large Margin Classifiers
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
Bernhard Schölkopf, Gökhan H. Bakir, Min...
ICCV
2003
IEEE
14 years 6 months ago
A Sparse Probabilistic Learning Algorithm for Real-Time Tracking
This paper addresses the problem of applying powerful pattern recognition algorithms based on kernels to efficient visual tracking. Recently Avidan [1] has shown that object recog...
Oliver M. C. Williams, Andrew Blake, Roberto Cipol...
NN
2010
Springer
189views Neural Networks» more  NN 2010»
12 years 11 months ago
Sparse kernel learning with LASSO and Bayesian inference algorithm
Kernelized LASSO (Least Absolute Selection and Shrinkage Operator) has been investigated in two separate recent papers (Gao et al., 2008) and (Wang et al., 2007). This paper is co...
Junbin Gao, Paul W. Kwan, Daming Shi
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
13 years 11 months ago
Kernel Polytope Faces Pursuit
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...
Tom Diethe, Zakria Hussain