Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Keerthi, S. S.
Right arrow Articles by Murthy, K. R. K.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Keerthi, S. S.
Right arrow Articles by Murthy, K. R. K.
(Neural Computation. 2001;13:637-649.)
© 2001 The MIT Press


Letter

Improvements to Platt's SMO Algorithm for SVM Classifier Design

S. S. Keerthi

Department of Mechanical and Production Engineering, National University of Singapore, Singapore-119260

S. K. Shevade

Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012, India

C. Bhattacharyya

Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012, India

K. R. K. Murthy

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:


Home page
BioinformaticsHome page
J. Cui, Q. Liu, D. Puett, and Y. Xu
Computational prediction of human proteins that can be secreted into the bloodstream
Bioinformatics, October 15, 2008; 24(20): 2370 - 2375.
[Abstract] [Full Text] [PDF]


Home page
INFORMS Journal on ComputingHome page
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]


Home page
BioinformaticsHome page
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]


Home page
BioinformaticsHome page
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]


Home page
BioinformaticsHome page
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]


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
W. Chu and S. S. Keerthi
Support vector ordinal regression.
Neural Comput., March 1, 2007; 19(3): 792 - 815.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
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
Copyright © 2001 by The MIT Press.