Abstract
The classification speed of state-of-the-art classifiers such as SVM is an important aspect to be considered for emerging applications and domains such as data mining and human-computer interaction. Usually, a test-time speed increase in SVMs is achieved by somehow reducing the number of support vectors, which allows a faster evaluation of the decision function. In this paper a novel approach is described for fast classification in a PCA+SVM scenario. In the proposed approach, classification of an unseen sample is performed incrementally in increasingly larger feature spaces. As soon as the classification confidence is above a threshold the process stops and the class label is retrieved. Easy samples will thus be classified using less features, thus producing a faster decision. Experiments in a gender recognition problem show that the method is by itself able to give good speed-error tradeoffs, and that it can also be used in conjunction with other SV-reduction algorithms to produce tradeoffs that are better than with either approach alone.
This is a preview of subscription content, log in via an institution to check access.
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
Guyon, I.: SVM application list (2010), http://www.clopinet.com/isabelle/Projects/SVM/applist.html
Decoste, D., Mazzoni, D.: Fast query-optimized kernel machine classification via incremental approximate nearest support vectors. In: International Conference on Machine Learning, pp. 115–122 (2003)
Fehr, J., Zapien, K., Burkhardt, H.: Fast support vector machine classification of very large datasets. In: Proceedings of the GfKl Conference, Data Analysis, Machine Learning, and Applications. LNCS, Springer, University of Freiburg, Germany (2007)
Zhana, Y., Shen, D.: Design efficient support vector machine for fast classification. Pattern Recognition 38(1), 157–161 (2005)
Arenas-García, J., Gómez-Verdejo, V., Figueiras-Vidal, A.R.: Fast evaluation of neural networks via confidence rating. Neurocomput 70(16-18), 2775–2782 (2007), http://dx.doi.org/10.1016/j.neucom.2006.04.014
Nguyen, D., Ho, T.: An efficient method for simplifying support vector machines. In: Procs. of the 22nd Int. Conf. on Machine Learning, pp. 617–624 (2005)
Guo, J., Takahashi, N., Nishi, T.: An efficient method for simplifying decision functions of support vector machines. IEICE Transactions 89-A(10), 2795–2802 (2006)
Turk, M.A., Pentland, A.: Eigenfaces for Recognition. Cognitive Neuroscience 3(1), 71–86 (1991), ftp://whitechapel.media.mit.edu/pub/images/
Phillips, P., Moon, H., Rizvi, S., Rauss, P.: The FERET evaluation methodology for face-recognition algorithms. TPAMI 22(10), 1090–1104 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Déniz-Suárez, O., Castrillón, M., Lorenzo, J., Bueno, G., Hernández, M. (2011). Fast Classification in Incrementally Growing Spaces. In: Vitrià, J., Sanches, J.M., Hernández, M. (eds) Pattern Recognition and Image Analysis. IbPRIA 2011. Lecture Notes in Computer Science, vol 6669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21257-4_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-21257-4_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21256-7
Online ISBN: 978-3-642-21257-4
eBook Packages: Computer ScienceComputer Science (R0)