Sparse kernel SVMs via cutting-plane training

DOI10.1007/s10994-009-5126-6zbMath1470.68123OpenAlexW2139451965MaRDI QIDQ1959504

Chun-Nam John Yu, Thorsten Joachims

Publication date: 7 October 2010

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-009-5126-6

zbMATH Keywords

kernel methodssupport vector machinesbasis pursuitcutting plane algorithmsparse kernel methods

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (8)

Two new decomposition algorithms for training bound-constrained support vector machines ⋮ Hierarchical mixing linear support vector machines for nonlinear classification ⋮ Fast support vector machines for convolution tree kernels ⋮ Learning with partition of unity-based kriging estimators ⋮ Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking ⋮ Stochastic Subgradient Estimation Training for Support Vector Machines ⋮ Nonlinear optimization and support vector machines ⋮ Nonlinear optimization and support vector machines

Uses Software

• SVMlight

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cutting-plane training of structural SVMs
• 10.1162/15324430260185619
• 10.1162/1532443041827925
• Kernel matching pursuit

This page was built for publication: Sparse kernel SVMs via cutting-plane training