Abstract
This chapter describes an active-set algorithm for quadratic programming problems that arise from the computation of support vector machines (SVMs). Currently, most SVM optimizers implement working-set (decomposition)techniques because of their ability to handle large data sets. Although these show good results in general, active-set methods are a reasonable alternative - in particular if the data set is not too large, if the problem is ill-conditioned, or if high precision is needed. Algorithms are derived for classification and regression with both fixed and variable bias term. The material is completed by acceleration and approximation techniques as well as a comparison with other optimization methods in application examples.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Vogt, M., Kecman, V. Active-Set Methods for Support Vector Machines. In: Wang, L. (eds) Support Vector Machines: Theory and Applications. Studies in Fuzziness and Soft Computing, vol 177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10984697_6
Download citation
DOI: https://doi.org/10.1007/10984697_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24388-5
Online ISBN: 978-3-540-32384-6
eBook Packages: EngineeringEngineering (R0)