Multiclass core vector machine
Authors:
Open Access
- 20 June 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 41-48
Abstract
Even though several techniques have been proposed in the literature for achieving multi- class classication using Support Vector Ma- chine(SVM), the scalability aspect of these approaches to handle large data sets still needs much of exploration. Core Vector Ma- chine(CVM) is a technique for scaling up a two class SVM to handle large data sets. In this paper we propose a Multiclass Core Vector Machine(MCVM). Here we formulate the multiclass SVM problem as a Quadratic Programming(QP) problem dening an SVM with vector valued output. This QP prob- lem is then solved using the CVM technique to achieve scalability to handle large data sets. Experiments done with several large synthetic and real world data sets show that the proposed MCVM technique gives good generalization performance as that of SVM at a much lesser computational expense. Fur- ther, it is observed that MCVM scales well with the size of the data set.Keywords
This publication has 5 references indexed in Scilit:
- Fast Single-Shot Multiclass Proximal Support Vector Machines and Perceptions2007
- Approximate minimum enclosing balls in high dimensions using core-setsACM Journal of Experimental Algorithmics, 2003
- A comparison of methods for multiclass support vector machinesIEEE Transactions on Neural Networks, 2002
- Estimating the Support of a High-Dimensional DistributionNeural Computation, 2001
- Practical Methods of Optimization2000