Name
Abstract | ||
|---|---|---|
Traditional extensions of the binary support vector machine (SVM) to multiclass problems are either heuristics or require solving a large dual optimization problem. Here, a generalized multiclass SVM is proposed called GenSVM. In this method classification boundaries for a K-class problem are constructed in a (K-1)-dimensional space using a simplex encoding. Additionally, several different weightings of the misclassification errors are incorporated in the loss function, such that it generalizes three existing multiclass SVMs through a single optimization problem. An iterative majorization algorithm is derived that solves the optimization problem without the need of a dual formulation. This algorithm has the advantage that it can use warm starts during cross validation and during a grid search, which significantly speeds up the training phase. Rigorous numerical experiments compare linear GenSVM with seven existing multiclass SVMs on both small and large data sets. These comparisons show that the proposed method is competitive with existing methods in both predictive accuracy and training time, and that it significantly outperforms several existing methods on these criteria. |
Year | Venue | Keywords |
|---|---|---|
2016 | JOURNAL OF MACHINE LEARNING RESEARCH | support vector machines,SVM,multiclass classification,iterative majorization,MM algorithm,classifier comparison |
Field | DocType | Volume |
Structured support vector machine,Hyperparameter optimization,Pattern recognition,Support vector machine,Heuristics,Artificial intelligence,MM algorithm,Cross-validation,Optimization problem,Mathematics,Machine learning,Multiclass classification | Journal | 17 |
ISSN | Citations | PageRank |
1532-4435 | 4 | 0.49 |
References | Authors | |
23 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gerrit J. J. van den Burg | 1 | 4 | 0.49 |
| Patrick J. F. Groenen | 2 | 84 | 11.72 |