Support Vector Machines (SVMs) are excellent candidate solutions to solving multi-class problems, and multi-class SVMs can be trained by several different methods. Different training methods commonly produce SVMs with different effectiveness, and no multi-class SVM training method always outperforms other multi-class SVM training methods on all problems. This raises difficulty for practitioners to choose the best training method for a given problem. In this work, we propose a Multi-class Method Selection (MMS) approach to help users select the most appropriate method among one-versus-one (OVO), one-versus-all (OVA) and structural SVMs (SSVMs) for a given problem. Our key idea is to select the training method based on the distribution of training data and the similarity between different classes. Using the distribution and class similarity, we estimate the unclassifiable rate of each multi-class SVM training method, and select the training method with the minimum unclassifiable rate. Our initial findings show: (i) SSVMs with linear kernel perform worse than OVO and OVA; (ii) MMS often produces SVM classifiers that can confidently classify unseen instances.
[1]
Chih-Jen Lin,et al.
LIBSVM: A library for support vector machines
,
2011,
TIST.
[2]
Chih-Jen Lin,et al.
A comparison of methods for multiclass support vector machines
,
2002,
IEEE Trans. Neural Networks.
[3]
Vladimir Vapnik,et al.
Statistical learning theory
,
1998
.
[4]
Kotagiri Ramamohanarao,et al.
MASCOT: Fast and Highly Scalable SVM Cross-Validation Using GPUs and SSDs
,
2014,
2014 IEEE International Conference on Data Mining.
[5]
Koby Crammer,et al.
On the Learnability and Design of Output Codes for Multiclass Problems
,
2002,
Machine Learning.