The Community for Technology Leaders
RSS Icon
Subscribe
Los Angeles, CA
March 31, 2009 to April 2, 2009
ISBN: 978-0-7695-3507-4
pp: 351-355
ABSTRACT
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, C_0 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.
INDEX TERMS
support vector machine, cost parameter, nonlinear programming, MPEC problem
CITATION
Yan Li-mei, "Parameter Selection Problems in Support Vector Machine", CSIE, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 351-355, doi:10.1109/CSIE.2009.103
141 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool