Machine Learning
Reduction Techniques for Instance-BasedLearning Algorithms
Machine Learning
Alpha seeding for support vector machines
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Multidimensional binary search trees used for associative searching
Communications of the ACM
Choosing Multiple Parameters for Support Vector Machines
Machine Learning
A comparison of methods for multiclass support vector machines
IEEE Transactions on Neural Networks
Efficient tuning of SVM hyperparameters using radius/margin bound and iterative algorithms
IEEE Transactions on Neural Networks
IEEE Transactions on Neural Networks
On the fusion of polynomial kernels for support vector classifiers
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Hi-index | 0.00 |
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.