Evaluation measures for kernel optimization

摘要

The main advantage of kernel methods stems from the implicit transformation of patterns to a high-dimensional feature space, thus a choice of a kernel function and proper setting of its parameters is of crucial importance. Learning a kernel from the data requires evaluation measures to assess the quality of the kernel. In this paper current state-of-the-art kernel evaluation measures are examined and their application to the kernel optimization is verified, showing limitations of these methods. As a result, alternative evaluation measures are proposed that strive to overcome these disadvantages. Results of experiments are provided to demonstrate that the application of the optimization process that leverages introduced measures results in kernels that correspond to the classifiers that achieve significantly lower error rate.