arXiv Analytics

Sign in

arXiv:1810.09828 [cs.LG]AbstractReferencesReviewsResources

DCSVM: Fast Multi-class Classification using Support Vector Machines

Duleep Rathgamage Don, Ionut E. Iacob

Published 2018-10-23Version 1

We present DCSVM, an efficient algorithm for multi-class classification using Support Vector Machines. DCSVM is a divide and conquer algorithm which relies on data sparsity in high dimensional space and performs a smart partitioning of the whole training data set into disjoint subsets that are easily separable. A single prediction performed between two partitions eliminates at once one or more classes in one partition, leaving only a reduced number of candidate classes for subsequent steps. The algorithm continues recursively, reducing the number of classes at each step, until a final binary decision is made between the last two classes left in the competition. In the best case scenario, our algorithm makes a final decision between $k$ classes in $O(\log k)$ decision steps and in the worst case scenario DCSVM makes a final decision in $k-1$ steps, which is not worse than the existent techniques.

Related articles: Most relevant | Search more
arXiv:1408.2869 [cs.LG] (Published 2014-08-12)
Cluster based RBF Kernel for Support Vector Machines
arXiv:1904.11803 [cs.LG] (Published 2019-04-26)
Robustness Verification of Support Vector Machines
arXiv:1008.4000 [cs.LG] (Published 2010-08-24)
NESVM: a Fast Gradient Method for Support Vector Machines