A New Strategy for Selecting Working Sets Applied in SMO

Authors:
Jianmin Li;Bo Zhang;Fuzong Lin
Affiliations:
-;-;-
Venue:
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
Year:
2002

Citing 0
Cited 2

A New Cache Replacement Algorithm in SMO

SVM '02 Proceedings of the First International Workshop on Pattern Recognition with Support Vector Machines
Candidate working set strategy based SMO algorithm in support vector machine

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

At present sequential minimal optimization (SMO) is one of the most popular and efficient training algorithms for support vector machines (SVM), especially for large-scale problems. A novel strategy for selecting working sets applied in SMO is presented in the paper. Based onthe original feasible direction method, the new strategy also takes the efficiency of kernel cache maintained in SMO into consideration. It is shown in the experiments on the well-known data sets that computation of the kernel function and training time is reduced greatly,especially for the problems with many samples and support vectors.