Candidate working set strategy based SMO algorithm in support vector machine

doi:10.1016/j.ipm.2009.05.002

Return

Candidate working set strategy based SMO algorithm in support vector machine

2009-09-01

PRE

宋

宋晓峰 (Xiaofeng Song) *

DOI：10.1016/j.ipm.2009.05.002

Original

Original request for help

Save

Abstract

En 中文

Sequential minimal optimization (SMO) is quite an efficient algorithm for training the support vector machine. The most important step of this algorithm is the selection of the working set, which greatly affects the training speed. The feasible direction strategy for the working set selection can decrease the objective function, however, may augment to the total calculation for selecting the working set in each of the iteration. In this paper, a new candidate working set (CWS) Strategy is presented considering the cost on the working set selection and cache performance. This new strategy can select several greatest violating samples from Cache as the iterative working sets for the next several optimizing steps, which can improve the efficiency of the kernel cache usage and reduce the computational cost related to the working set selection. The results of the theory analysis and experiments demonstrate that the proposed method can reduce the training time, especially on the large-scale datasets. (C) 2009 Elsevier Ltd. All rights reserved.

Keywords:

Support vector machine

SMO

Candidate working set strategy

Kernel cache

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.