Multiple kernel clustering

Maximum margin clustering (MMC) has recently attracted considerable interests in both the data mining and machine learning communities. It rst projects data samples to a kernel-induced feature space and then performs clustering by nding the maximum margin hyperplane over all possible cluster labelings. As in other kernel methods, choosing a suitable kernel function is imperative to the success of maximum margin clustering. In this paper, we propose a multiple kernel clustering (MKC) algorithm that simultaneously nds the maximum margin hyperplane, the best cluster labeling, and the optimal kernel. Moreover, we provide detailed analysis on the time complexity of the MKC algorithm and also extend multiple kernel clustering to the multi-class scenario. Experimental results on both toy and real-world data sets demonstrate the e ectiveness and efficiency of the MKC algorithm