DocumentCode :
2498340
Title :
Extract candidates of support vector from training set
Author :
Liu, Yang-guang ; Chen, Qi ; Yu, Rui-zhao
Author_Institution :
Coll. of Comput. Sci., Zhejiang Univ., Hangzhou, China
Volume :
5
fYear :
2003
fDate :
2-5 Nov. 2003
Firstpage :
3199
Abstract :
This paper proposes a heuristic method to extract candidates of support vector from training set. Training a support vector on the extracted candidates, we attain good generalization on test set. It shows that candidates of support vector contain almost all the necessary information to solve a given classification task. This method is also applied to incorporate prior knowledge into support vector machines. Experiments on digits recognition show the same performance as virtual support vector method.
Keywords :
heuristic programming; learning (artificial intelligence); support vector machines; SVM; digits recognition; heuristic method; support vector machines; training set; virtual support vector method; Computational efficiency; Computer science; Data mining; Databases; Educational institutions; Quadratic programming; Robustness; Support vector machine classification; Support vector machines; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2003 International Conference on
Print_ISBN :
0-7803-8131-9
Type :
conf
DOI :
10.1109/ICMLC.2003.1260130
Filename :
1260130
Link To Document :
بازگشت