DocumentCode
478100
Title
The Extensions of v-Support Vector Classification
Author
Zhong, Ping
Author_Institution
Coll. of Sci., China Agric. Univ., Beijing
Volume
2
fYear
2008
fDate
18-20 Oct. 2008
Firstpage
202
Lastpage
205
Abstract
Two extension models of v-support vector classification (v-SVC), the model called v-SVC+ and another mixed model with noise, are investigated. They have the ability to learn the hidden information of training data which the conventional model is incapable. For the mixed model, when epsivrarr1, the parameter v has the significant that it is an upper bound on the fraction of margin errors and a lower bound on the fraction of support vectors, which is also testified by the experiments.
Keywords
learning (artificial intelligence); pattern classification; support vector machines; hidden information learning; mixed model; v-SVC+ model; v-support vector classification extension model; Educational institutions; Kernel; Quadratic programming; Space technology; Static VAr compensators; Statistical learning; Support vector machines; Testing; Training data; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation, 2008. ICNC '08. Fourth International Conference on
Conference_Location
Jinan
Print_ISBN
978-0-7695-3304-9
Type
conf
DOI
10.1109/ICNC.2008.342
Filename
4666986
Link To Document