Radial Basis Function Kernel Optimization for Pattern Classification
AbstractThe main advantage of the kernel methods is the possibility of using linear models in a nonlinear subspace by an implicit transformation of patterns to a high-dimensional feature space without computing their images directly. An appropriately constructed kernel results in a model that fits well to the structure underlying data and doesn’t over-fit to the sample. Recent state-of-the-art kernel evaluation measures are examined in this paper and their application in kernel optimization is verified. Alternative evaluation measures that outperform presented methods are proposed.Optimization leveraging these measures results in parameters corresponding to the classifiers that achieve minimal error rate for RBF kernel.
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.