MULTIPLE KERNEL MAXIMUM MARGIN CRITERION

Maximum Margin Criterion (MMC) is an efficient and robust feature extraction method, which has been proposed recently. Like other kernel methods, when MMC is extended to Reproducing Kernel Hilbert Space via kernel trick, its performance heavily depends on the choice of kernel. In this paper, we address the problem of learning the optimal kernel over a convex set of prescribed kernels for Kernel MMC (KMMC). We will give an equivalent graph based formulation of MMC, based on which we present Multiple Kernel Maximum Margin Criterion (MKMMC). Then we will show that MKMMC can be solved via alternative optimization schema. Experiments on benchmark image recognition data sets show that the proposed method outperforms KMMC via cross validation, as well as some state of the art methods.