|
|
||||||||
Letter |
Department of Mechanical and Production Engineering, National University of Singapore, Singapore-119260
Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012, India
Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012, India
Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012, India
This article points out an important source of inefficiency in Platt's sequential minimal optimization (SMO) algorithm 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. These modified algorithms perform significantly faster than the original SMO on all benchmark data sets tried.
This article has been cited by other articles:
![]() |
H. Aytug, G. J. Koehler, and L. He Risk Minimization and Minimum Description for Linear Discriminant Functions INFORMS Journal on Computing, January 1, 2008; 20(2): 317 - 331. [Abstract] [PDF] |
||||
![]() |
M. N. Davies, A. Secker, A. A. Freitas, M. Mendao, J. Timmis, and D. R. Flower On the hierarchical classification of G protein-coupled receptors Bioinformatics, December 1, 2007; 23(23): 3113 - 3118. [Abstract] [Full Text] [PDF] |
||||
![]() |
K. Chen and L. Kurgan PFRES: protein fold classification by using evolutionary information and predicted secondary structure Bioinformatics, November 1, 2007; 23(21): 2843 - 2850. [Abstract] [Full Text] [PDF] |
||||
![]() |
P. Smialowski, A. J. Martin-Galiano, A. Mikolajka, T. Girschick, T. A. Holak, and D. Frishman Protein solubility: sequence based prediction and experimental verification Bioinformatics, October 1, 2007; 23(19): 2536 - 2542. [Abstract] [Full Text] [PDF] |
||||
![]() |
L. Bo, L. Wang, and L. Jiao Recursive finite newton algorithm for support vector regression in the primal. Neural Comput., April 1, 2007; 19(4): 1082 - 1096. [Abstract] [Full Text] [PDF] |
||||
![]() |
W. Chu and S. S. Keerthi Support vector ordinal regression. Neural Comput., March 1, 2007; 19(3): 792 - 815. [Abstract] [Full Text] [PDF] |
||||
![]() |
T. Knebel, S. Hochreiter, and K. Obermayer An SMO Algorithm for the Potential Support VectorMachine Neural Comput., January 1, 2007; 20(1): 271 - 287. [Abstract] [Full Text] [PDF] |
||||
![]() |
W. Chu, S. S. Keerthi, and C. J. Ong Bayesian Trigonometric Support Vector Classifier Neural Comput., September 1, 2003; 15(9): 2227 - 2254. [Abstract] [Full Text] |
||||
![]() |
S.S. Keerthi and S.K. Shevade SMO Algorithm for Least-Squares SVM Formulations Neural Comput., February 1, 2003; 15(2): 487 - 507. [Abstract] [Full Text] [PDF] |
||||
![]() |
S.-P. Liao, H.-T. Lin, and C.-J. Lin A Note on the Decomposition Methods for Support Vector Regression Neural Comput., June 1, 2002; 14(6): 1267 - 1281. [Abstract] [Full Text] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |