Meta-Parameters of Kernel Methods and Their Optimization

Abstrakt

In this work we deal with the problem of metalearning for kernel based methods. Among the kernel methods we focus on the support vector machine (SVM), that have become a method of choice in a wide range of practical applications, and on the regularization network (RN) with a sound background in approximation theory. We discuss the role of kernel function in learning, and we explain several search methods for kernel function optimization, including grid search, genetic search and simulated annealing. The proposed methodology is demonstrated on experiments using benchmark data sets.