论文信息 - Improving Support Vector Solutions by Selecting a Sequence of Training Subsets

Improving Support Vector Solutions by Selecting a Sequence of Training Subsets

In this paper we demonstrate that it is possible to gradually improve the performance of support vector machine (SVM) classifiers by using a genetic algorithm to select a sequence of training subsets from the available data. Performance improvement is possible because the SVM solution generally lies some distance away from the Bayes optimal in the space of learning parameters. We illustrate performance improvements on a number of benchmark data sets.

Tom Downs | Jianxiong Wang

[1] Mario Marchand,et al. Computing the Bayes Kernel Classifler , 2004 .

[2] Pal Rujan,et al. Playing Billiards in Version Space , 1997, Neural Computation.

[3] Alexander J. Smola,et al. Advances in Large Margin Classifiers , 2000 .

[4] Bernhard Schölkopf,et al. Computing the Bayes Kernel Classifier , 2000 .

[5] T. Watkin. Optimal Learning with a Neural Network , 1993 .

[6] Bernhard E. Boser,et al. A training algorithm for optimal margin classifiers , 1992, COLT '92.

[7] Opper,et al. Generalization performance of Bayes optimal classification algorithm for learning a perceptron. , 1991, Physical review letters.

[8] Tom Downs,et al. Tuning pattern classifier parameters using a genetic algorithm with an application in mobile robotics , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[9] Colin Campbell,et al. Bayes Point Machines , 2001, J. Mach. Learn. Res..

[10] Nello Cristianini,et al. The Kernel-Adatron : A fast and simple learning procedure for support vector machines , 1998, ICML 1998.

[11] Ralf Herbrich,et al. Bayes Point Machines: Estimating the Bayes Point in Kernel Space , 1999 .

[12] Nello Cristianini,et al. The Kernel-Adatron Algorithm: A Fast and Simple Learning Procedure for Support Vector Machines , 1998, ICML.