Provably fast training algorithms for support vector machines

DOI10.1007/s00224-007-9094-6zbMath1140.68055OpenAlexW1986630010MaRDI QIDQ927401

Yang Dai, José L. Balcázar, Osamu Watanabe, Junichi Tanaka

Publication date: 6 June 2008

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9094-6

zbMATH Keywords

Support Vector MachineCombinatorial dimensionRandom sampling techniqueSVM training algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Online training on a budget of support vector machines using twin prototypes

Uses Software

• RSVM

Cites Work

• A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
• On a kernel-based method for pattern recognition, regression, approximation, and operator inversion
• Polynomial-time decomposition algorithms for support vector machines
• Support-vector networks
• On the mathematical foundations of learning
• 10.1162/15324430260185619
• Las Vegas algorithms for linear and integer programming when the dimension is small
• A Note on the Decomposition Methods for Support Vector Regression
• A simple sampling lemma: Analysis and applications in geometric optimization
• Convergence of a generalized SMO algorithm for SVM classifier design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Provably fast training algorithms for support vector machines