Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/77178 
Year of Publication: 
1998
Series/Report no.: 
Technical Report No. 1998,28
Publisher: 
Universität Dortmund, Sonderforschungsbereich 475 - Komplexitätsreduktion in Multivariaten Datenstrukturen, Dortmund
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 on the shelf optimization techniques for general quadratic programs quickly become intractable in their memory and time requirements. SVM light is an implementation of an SVM learner which addresses the problem of large tasks. This chapter presents algorithmic and computational results developed for SVM light V 2.0, which make large-scale SVM training more practical. The results give guidelines for the application of SVMs to large domains.
Document Type: 
Working Paper

Files in This Item:
File
Size
718.45 kB
848.66 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.