Feasible direction decomposition algorithms for training support vector machines

DOI10.1023/A:1012479116909MaRDI QIDQ5959965zbMATH OpenOpenAlexFDO

Authors Pavel Laskov

Publication date 11 April 2002

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1012479116909

zbMATH Keywords

working set selection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Polynomial-time decomposition algorithms for support vector machines
• A convergent decomposition algorithm for support vector machines
• A simple decomposition algorithm for support vector machines with polynomial-time convergence
• A new convergent decomposition algorithm for solving large scale support vector machines
• A simple decomposition method for support vector machines

Cited in

(11)

• Polynomial-time decomposition algorithms for support vector machines
• On the complexity of working set selection
• An efficient support vector machine learning method with second-order cone programming for large-scale problems
• Two new decomposition algorithms for training bound-constrained support vector machines
• Training v-Support Vector Regression: Theory and Algorithms
• Neighborhood Property–Based Pattern Selection for Support Vector Machines
• A Note on the Decomposition Methods for Support Vector Regression
• A faster gradient ascent learning algorithm for nonlinear SVM
• Decomposition Methods for Linear Support Vector Machines
• scientific article; zbMATH DE number 5169330 (Why is no real title available?)
• Parameter selection of support vector regression based on hybrid optimization algorithm and its application

Describes a project that uses

Uses Software

• SVMlight

This page was built for publication: Feasible direction decomposition algorithms for training support vector machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959965)