论文信息 - Improvements to the SMO algorithm for SVM regression

Improvements to the SMO algorithm for SVM regression

This paper points out an important source of inefficiency in Smola and Schölkopf's sequential minimal optimization (SMO) algorithm for support vector machine (SVM) regression that is caused by the use of a single threshold value. Using clues from the KKT conditions for the dual problem, two threshold parameters are employed to derive modifications of SMO for regression. These modified algorithms perform significantly faster than the original SMO on the datasets tried.

[1] Christopher J. Merz,et al. UCI Repository of Machine Learning Databases , 1996 .

[2] J. C. BurgesChristopher. A Tutorial on Support Vector Machines for Pattern Recognition , 1998 .

[3] Alexander J. Smola,et al. Learning with kernels , 1998 .

[4] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .

[5] S. Sathiya Keerthi,et al. A fast iterative nearest point algorithm for support vector machine classifier design , 2000, IEEE Trans. Neural Networks Learn. Syst..

[6] Vladimir N. Vapnik,et al. The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[7] Bernhard Schölkopf,et al. Learning with kernels , 2001 .