Fast Classification in Incrementally Growing Spaces
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.
Keywordsgender recognition Support Vector Machines Principal Component Analysis Eigenfaces
Unable to display preview. Download preview PDF.
- 1.Guyon, I.: SVM application list (2010), http://www.clopinet.com/isabelle/Projects/SVM/applist.html
- 2.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)Google Scholar
- 3.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)Google Scholar
- 6.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)Google Scholar