Making Large - Scale SVM Learning Practical

Abstract

Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large learning tasks with many training examples, o -the-shelf optimization techniques for general quadratic programs quickly become intractable in their memory and time requirements. SV M light1 is an implementation of an SVM learner which addresses the problem of large tasks. This chapter presents algorithmic and computational results developed for SV M V2.0, which make large-scale SVM training more practical. The results give guidelines for the application of SVMs to large domains.

Extracted Key Phrases

6 Figures and Tables

0200400600'99'01'03'05'07'09'11'13'15'17
Citations per Year

8,337 Citations

Semantic Scholar estimates that this publication has 8,337 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Joachims1999MakingL, title={Making Large - Scale SVM Learning Practical}, author={Thorsten Joachims}, year={1999} }