A Note on the Decomposition Methods for Support Vector Regression

DOI10.1162/089976602753712936MaRDI QIDQ4542417zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Shuo-Peng Liao, Hsuan-Tien Lin, Chih-Jen Lin

Publication date 20 October 2002

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL http://ntur.lib.ntu.edu.tw//handle/246246/155225

zbMATH Keywords

support vector regression

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A simple decomposition method for support vector machines
• On the working set selection in gradient projection-based decomposition techniques for support vector machines
• Training v-Support Vector Regression: Theory and Algorithms
• Learning Theory
• SVMTorch: Support vector machines for large-scale regression problems.

Cites work

• Efficient SVM regression training with SMO
• Feasible direction decomposition algorithms for training support vector machines
• Improvements to Platt's SMO Algorithm for SVM Classifier Design
• SVMTorch: Support vector machines for large-scale regression problems.

Cited in

(5)

• On the complexity of working set selection
• scientific article; zbMATH DE number 5957500 (Why is no real title available?)
• scientific article; zbMATH DE number 5661352 (Why is no real title available?)
• A simple decomposition algorithm for support vector machines with polynomial-time convergence
• Provably fast training algorithms for support vector machines

This page was built for publication: A Note on the Decomposition Methods for Support Vector Regression

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