Multiple Kernel Learning Based Multi-view Spectral Clustering

Publication Type:
Conference Proceeding
2014 22nd International Conference on Pattern Recognition (ICPR), 2014, pp. 3774 - 3779
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
mu.pdfPublished version167.5 kB
Adobe PDF
For a given data set, exploring their multi-view instances under a clustering framework is a practical way to boost the clustering performance. This is because that each view might reflect partial information for the existing data. Furthermore, due to the noise and other impact factors, exploring these instances from different views will enhance the mining of the real structure and feature information within the data set. In this paper, we propose a multiple kernel spectral clustering algorithm through the multi-view instances on the given data set. By combining the kernel matrix learning and the spectral clustering optimization into one process framework, the algorithm can determine the kernel weights and cluster the multi-view data simultaneously. We compare the proposed algorithm with some recent published methods on real-world datasets to show the efficiency of the proposed algorithm.
Please use this identifier to cite or link to this item: