Abstract
In recent years, the support vector machine (SVM) has been extensively applied to deal with various data classification problems. However, it has also been observed that, for some datasets, the classification accuracy delivered by the SVM is very sensitive to how the cost parameter and the kernel parameters are set. As a result, the user may need to conduct extensive cross validation in order to figure out the optimal parameter setting. How to expedite the model selection process of the SVM has attracted a high degree of attention in the machine learning research community in recent years. This paper proposes an advanced data reduction algorithm aimed at expediting the model selection process of the SVM. Experimental results reveal that the proposed mechanism is able to deliver a speedup of over 70 times without causing meaningful side effects and compares favorably with the alternative approaches.
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
Cortes, C., Vapnik, V.: Support-vector network. Machine Learning 20, 273–297 (1995)
Hsu, C.W., Lin, C.J.: A comparison of methods for multi-class support vector machines. IEEE Transactions on Neural Networks 13, 415–425 (2002)
Chapelle, O., Vapnik, V., Bousquet, O., Mukherjee, S.: Choosing multiple parameters for support vector machines. Machine Learning 46, 131–159 (2002)
DeCoste, D., Wagstaff, K.: Alpha seeding for support vector machines. In: Proceedings of International Conference on Knowledge Discovery and Data Mining (KDD-2000) (2000)
Keerthi, S.S.: Efficient tuning of SVM hyperparameters using radius/margin bound and iterative algorithms. IEEE Transactions on Neural Networks 13, 1225–1229 (2002)
Ou, Y.Y., Chen, C.Y., Hwang, S.C., Oyang, Y.J.: Expediting model selection for support vector machines based on data reduction. In: Proc. IEEE International Conference on Systems, Man and Cybernetics (SMC2003), pp. 786–791 (2003)
Oyang, Y.J., Hwang, S.C., Ou, Y.Y., Chen, C.Y., Chen, Z.W.: Data classification with radial basis function networks based on a novel kernel density estimation algorithm. IEEE Transactions on Neural Networks 16, 225–236 (2005)
Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-based learning algorithms. Machine Learning 38, 257–286 (2000)
Bentley, J.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18(9), 509–517 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ou, YY., Chen, GH., Oyang, YJ. (2006). Expediting Model Selection for Support Vector Machines Based on an Advanced Data Reduction Algorithm. In: Yang, Q., Webb, G. (eds) PRICAI 2006: Trends in Artificial Intelligence. PRICAI 2006. Lecture Notes in Computer Science(), vol 4099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36668-3_125
Download citation
DOI: https://doi.org/10.1007/978-3-540-36668-3_125
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36667-6
Online ISBN: 978-3-540-36668-3
eBook Packages: Computer ScienceComputer Science (R0)