By Topic

Parameter Selection Problems in Support Vector Machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yan Li-mei ; Math. Dept., Dezhou Univ., Dezhou, China

In this paper, we present a new SVM model to calculate the optimal value of cost parameter C for particular problems of linearity non-separability of data. A lower bound, positive number, C0 is required to provide for avoiding choosing a candidate set of C. Numerical experiments show that this model for choice of is suitable for solving SVM problems.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:4 )

Date of Conference:

March 31 2009-April 2 2009