Semi-supervised clustering with metric learning: An adaptive kernel method

作者:

Highlights:

摘要

Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel methods for semi-supervised clustering not only face the problem of manually tuning the kernel parameters due to the fact that no sufficient supervision is provided, but also lack a measure that achieves better effectiveness of clustering. In this paper, we propose an adaptive Semi-supervised Clustering Kernel Method based on Metric learning (SCKMM) to mitigate the above problems. Specifically, we first construct an objective function from pairwise constraints to automatically estimate the parameter of the Gaussian kernel. Then, we use pairwise constraint-based K-means approach to solve the violation issue of constraints and to cluster the data. Furthermore, we introduce metric learning into nonlinear semi-supervised clustering to improve separability of the data for clustering. Finally, we perform clustering and metric learning simultaneously. Experimental results on a number of real-world data sets validate the effectiveness of the proposed method.

论文关键词:Metric learning,Pairwise constraint,Closure centroid,Semi-supervised clustering

论文评审过程:Received 1 July 2008, Revised 26 June 2009, Accepted 9 November 2009, Available online 14 November 2009.

论文官网地址:https://doi.org/10.1016/j.patcog.2009.11.005