Convergence of a new decomposition algorithm for support vector machines

Authors:
Yan-Guo Wang;Hong Qiao;Bo Zhang
Affiliations:
Institute of Automation, Chinese Academy of Sciences, Beijing, China;Institute of Automation, Chinese Academy of Sciences, Beijing, China;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China
Venue:
ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
Year:
2006

Citing 11
Cited 0

The nature of statistical learning theory

The nature of statistical learning theory
Advances in kernel methods: support vector learning

Advances in kernel methods: support vector learning
Making large-scale support vector machine learning practical

Advances in kernel methods
Fast training of support vector machines using sequential minimal optimization

Advances in kernel methods
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery
Convergence of a Generalized SMO Algorithm for SVM Classifier Design

Machine Learning
Training Support Vector Machines: an Application to Face Detection

CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Improvements to Platt's SMO Algorithm for SVM Classifier Design

Neural Computation
On the convergence of the decomposition method for support vector machines

IEEE Transactions on Neural Networks
Asymptotic convergence of an SMO algorithm without any assumptions

IEEE Transactions on Neural Networks
A formal analysis of stopping criteria of decomposition methods for support vector machines

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Decomposition methods is the main way for solving support vector machines (SVMs) with large data sets. In this paper a new decomposition algorithm is proposed, and its convergence is also proved.