Abstract
According to the Support Vector Machine algorithm, the task of classification depends on a subset of the original data-set, which is the set of Support Vectors (SVs). They are the only information needed to compute the discriminating function between the classes and, therefore, to classify new data. Since both the computational complexity and the memory requirements of the algorithm depend on the number of SVs, this property is very appealing from the point of view of hardware implementations. For this reason, many researchers have proposed new methods to reduce the number of SVs, even at the expenses of a larger error rate. We propose in this work a method which aims at finding a single point per each class, called archetype, which allows to reconstruct the classifier found by the SVM algorithm, without suffering any classification rate loss. The method is also extended to the case of non-linear classification by finding an approximation of the archetypes in the input space, which maintain the ability to classify the data with a moderate increase of the error rate.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cortes, C., Vapnik, V.N. Support Vector Networks, Machine Learning Vol. 20, pp. 1–25, 1995.
Downs, T., Gates, K.E., Masters, A. Exact simplification of support vector solutions Journal of Machine Learning Research, Vol. 2, pp. 293–297, December 2001.
Duda, R.O., Hart, P.E. Pattern Classification and Scene Analysis John Wiley & Sons, see page 218, 1973.
Genton, M.G. Classes of Kernels for Machine Learning: A Statistics Perspective, Journal of Machine Learning Research, Vol. 2, pp. 299–312, 2001.
Johnstone, V.S., Hagel, R., Franklin, M., Fink, B., Grammer, K. Male facial attractiveness evidence for hormone-mediated adaptive design. Evolution and Human Behavior, Vol.22 pp. 251–267, 2001.
O’Toole, A.J., Millward, R.B. and Anderson, J.A., A physical system approach to recognition memory for spatially transformed faces Neural Networks, Vol. 1, pp. 179–199, 1988.
Schölkopf, B., Burges, C.J.C., Smola, A.J. Advances in kernel methods: support vector learning MIT Press, 1998.
Schölkopf, B., Knirsch, P., Smola, A. and Burges, C. Fast approximation of support vector kernel expansions, and an interpretation of clustering as approximation in feature spaces In P. Levi, M. Schanz, R.-J. Ahlers, and F. May, editors, Mustererkennung 1998—20. DAGM-Symposium, Informatik aktuell, pp. 124–132, Berlin, Springer, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Anguita, D., Ridella, S., Rivieccio, F. (2006). An Algorithm for Reducing the Number of Support Vectors. In: Apolloni, B., Marinaro, M., Tagliaferri, R. (eds) Biological and Artificial Intelligence Environments. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3432-6_12
Download citation
DOI: https://doi.org/10.1007/1-4020-3432-6_12
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3431-2
Online ISBN: 978-1-4020-3432-9
eBook Packages: Computer ScienceComputer Science (R0)