Improvements to Platt’s SMO algorithm for SVM classifier design. (English) Zbl 1085.68629

Summary: 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.


68T05 Learning and adaptive systems in artificial intelligence


Full Text: DOI


[1] DOI: 10.1080/10556789208805504 · doi:10.1080/10556789208805504
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.