Simplify decision function of reduced support vector machines

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Reduced Support Vector Machines (RSVM) was proposed as the alternate of standard support vector machines (SVM) in order to resolve the difficulty in the learning of nonlinear SVM for large data set problems. RSVM preselects a subset as support vectors and solves a smaller optimization problem, and it performs well with remarkable efficiency on training of SVM for large problem. All the training points of the subset will be support vectors, and more training points are selected into this subset results in high possibility to obtain RSVM with better generalization ability. So we first obtain the RSVM with more support vectors, and selects out training examples near classification hyper plane. Then only these training examples are used as training set to obtain a standard SVM with less support vector than that of RSVM. Computational results show that standard SVMs on the basis of RSVM have much less support vectors and perform equal generalization ability to that of RSVM. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Li, Y., Zhang, W., Wang, G., & Cai, Y. (2005). Simplify decision function of reduced support vector machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3789 LNAI, pp. 435–442). Springer Verlag. https://doi.org/10.1007/11579427_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free