A Stochastic Optimization Approach for Parameter Tuning of Support Vector Machines

Authors:
F. Imbault;K. Lebart
Affiliations:
Heriot Watt University, Scotland, UK;Heriot Watt University, Scotland, UK
Venue:
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
Year:
2004

Citing 0
Cited 9

Improving radial basis function kernel classification through incremental learning and automatic parameter selection

Neurocomputing
Choosing the kernel parameters for support vector machines by the inter-cluster distance in the feature space

Pattern Recognition
Construct support vector machine ensemble to detect traffic incident

Expert Systems with Applications: An International Journal
Analog circuits optimization based on evolutionary computation techniques

Integration, the VLSI Journal
SVM with stochastic parameter selection for bovine leather defect classification

PSIVT'07 Proceedings of the 2nd Pacific Rim conference on Advances in image and video technology
An ACO-based algorithm for parameter optimization of support vector machines

Expert Systems with Applications: An International Journal
Least squares support vector machines with tuning based on chaotic differential evolution approach applied to the identification of a thermal process

Expert Systems with Applications: An International Journal
Improving classification performance of Support Vector Machine by genetically optimising kernel shape and hyper-parameters

Applied Intelligence
Combining color and haar wavelet responses for aerial image classification

ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Support Vector Machines (SVMs) are both mathematically well-funded and efficient in a large number of real-world applications. However, the classification results highly depend on the parameters of the model: the scale of the kernel and the regularization parameter. Estimating these parameters is referred to as tuning. Tuning requires to estimate the generalization error and to find its minimum over the parameter space. Classical methods use a local minimization approach. After empirically showing that the tuning of parameters presents local minima, we investigate in this paper the use of global minimization techniques, namely genetic algorithms and simulated annealing. This latter approach is compared to the standard tuning frameworks and provides a more reliable tuning method.