Composite Kernels for Semi-Supervised Clustering
Document Type
Article
Publication Date
7-1-2011
Abstract
A critical problem related to kernel-based methods is how to select optimal kernels. A kernel function must conform to the learning target in order to obtain meaningful results. While solutions to the problem of estimating optimal kernel functions and corresponding parameters have been proposed in a supervised setting, it remains a challenge when no labeled data are available, and all we have is a set of pairwise must-link and cannot-link constraints. In this paper, we address the problem of optimizing the kernel function using pairwise constraints for semi-supervised clustering. We propose a new optimization criterion for automatically estimating the optimal parameters of composite Gaussian kernels, directly from the data and given constraints. We combine our proposal with a semi-supervised kernel-based algorithm to demonstrate experimentally the effectiveness of our approach. The results show that our method is very effective for kernel-based semi-supervised clustering.
DOI
10.1007/s10115-010-0318-8
Montclair State University Digital Commons Citation
Domeniconi, Carlotta; Peng, Jing; and Yan, Bojun, "Composite Kernels for Semi-Supervised Clustering" (2011). Department of Computer Science Faculty Scholarship and Creative Works. 178.
https://digitalcommons.montclair.edu/compusci-facpubs/178