Optimal Feature Representation for Kernel Machines using Kernel-Target Alignment Criterion
Abstract
Kernel-target alignment is commonly used to predict the behavior of any given reproducing kernel in a classification context, without training any kernel machine. In this paper, we present a gradient ascent algorithm for maximizing the alignment over linear transform of the input space. Our method is compared to the minimization of the radius-margin bound. Experimental results on multi-dimensional benchmarks show the effectiveness of our approach.