A fast iterative algorithm for fisher discriminant using heterogeneous kernels

We propose a fast iterative classification algorithm for Kernel Fisher Discriminant (KFD) using heterogeneous kernel models. In contrast with the standard KFD that requires the user to predefine a kernel function, we incorporate the task of choosing an appropriate kernel into the optimization problem to be solved. The choice of kernel is defined as a linear combination of kernels belonging to a potentially large family of different positive semidefinite kernels. The complexity of our algorithm does not increase significantly with respect to the number of kernels on the kernel family. Experiments on several benchmark datasets demonstrate that generalization performance of the proposed algorithm is not significantly different from that achieved by the standard KFD in which the kernel parameters have been tuned using cross validation. We also present results on a real-life colon cancer dataset that demonstrate the efficiency of the proposed method.

• Type: Conference
• Year: 2004
• Where: ICML
• Authors: Glenn Fung, Murat Dundar, Jinbo Bi, R. Bharat Rao
• Keywords: Heterogeneous Kernel Models, ICML 2004, Kernel Fisher, Kernel Parameters, Machine Learning