The week's pick
Reseach Article
Constructing Support Vector Machines with Reduced Classifier Complexity
| National Conference on Emerging Trends in Advanced Communication Technologies |
| Foundation of Computer Science USA |
| NCETACT2015 - Number 2 |
| June 2015 |
| Authors: Ankur M. Bobade, N. N. Khalsa, S. M. Deshmukh |
| ac4954e8-34f9-48d7-a0b5-9f85ed52405d |
Ankur M. Bobade, N. N. Khalsa, S. M. Deshmukh . Constructing Support Vector Machines with Reduced Classifier Complexity. National Conference on Emerging Trends in Advanced Communication Technologies. NCETACT2015, 2 (June 2015), 1-5.
Abstract
Support vector machines (SVMs), though perfect, are not chosen in applications requiring great classi?cation speed, due to the number of support vectors being large. To conquer this problem we devise a primitive method with the following properties: (1) it decouples the idea of basis functions from the concept of support vectors; (2) it materialistically ?nds a set of kernel basis functions of a speci?ed maximum size (dmax) to approximate the SVM primitive cost function well; (3) it is ef?cient and roughly scales as O(ndmax2)where n is the number of training examples; and, (4) the number of basis functions it requires to accomplish an accuracy close to the SVM accuracy is usually far less than the number of SVM support vectors.
References
- J. Adler, B. D. Rao, and K. Kreutz-Delgado. Comparison of basis selection methods,1996.
- F. Bach and M. Jordan. Predictive low-rank decomposition for kernel methods, 2005.
- K. P. Bennett, M. Momma, and M. J. Embrechts. MARK: A boosting algorithm for heterogeneous kernel models,2002.
- J. Bi, T. Zhang, and K. P. Bennet. Column generation boosting methods for mixture of kernels. 2004.
- C. J. C. Burges and B. Sch¨olkopf. Improving the accuracy and speed of support vector learning machines,1997.
- O. Chapelle. Training a support vector machine in the primitive. Journal of Machine Learning Re-search, 2005.
- D. DeCoste and B. Sch¨olkopf. Training invariant support vector machines. Machine Learning, 2002.
- T. Downs, K. E. Gates, and A. Masters. Exact simpli?cation of support vector solutions, 2001.
- J. H. Friedman. Greedy function approximation: a gradient boosting machine. Annals of Statistics, 2001.
- T. Joachims. Making large-scale SVM learning practical. In Advances in Kernel Methods – Support Vector Learning. MIT Press, Cambridge, Massachussetts, 1999.
- S. S. Keerthi and W. Chu. A matching pursuit approach to sparse Gaussian process regression.
- S. S. Keerthi and D. DeCoste. A modi?ed ?nite Newton method for fast solution of large scale linear svms, 2005.
Index Terms
Keywords