Two heuristic strategies for searching optimal hyper parameters of C-SVM

Searching optimal hyper parameters of support vector machine classifier has biggish effect to the performance of the classifier. It could be found through k-fold cross-validation to penalty factor C and parameter σ in Gauss kernel function based on grid searching that the distribution of classifier precision is of isoline and multi-peak value. According to this, two heuristic search strategies are established, two-point central vertical method and multi-point barycenter method. The framework of corresponding heuristic algorithm is established based on the strategies. Simulation experiments show that the algorithm is helpful to accelerating the process searching optimal hyper parameters of SVM classifier.