Improvements to Platt's SMO Algorithm for SVM Classifier Design

  • Authors:
  • S. S. Keerthi;S. K. Shevade;C. Bhattacharyya;K. R. K. Murthy

  • Affiliations:
  • 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

  • Venue:
  • Neural Computation
  • Year:
  • 2001

Quantified Score

Hi-index 0.02

Visualization

Abstract

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.