Parameter Selection Problems in Support Vector Machine

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
₀
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.