• Title of article

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

  • Author/Authors

    Yin، نويسنده , , Xuesong and Chen، نويسنده , , Songcan and Hu، نويسنده , , Enliang and Zhang، نويسنده , , Daoqiang، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2010
  • Pages
    14
  • From page
    1320
  • To page
    1333
  • Abstract
    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.
  • Keywords
    Pairwise constraint , Closure centroid , Semi-supervised clustering , Metric learning
  • Journal title
    PATTERN RECOGNITION
  • Serial Year
    2010
  • Journal title
    PATTERN RECOGNITION
  • Record number

    1733346