首页 | 本学科首页   官方微博 | 高级检索  
     


Semi-supervised clustering with metric learning: An adaptive kernel method
Authors:Xuesong Yin [Author Vitae]  Songcan Chen [Author Vitae]  Enliang Hu [Author Vitae] [Author Vitae]
Affiliation:a Department of Computer Science & Engineering, Nanjing University of Aeronautics & Astronautics, China
b Department of Computer Science & Technology, Zhejiang Radio & TV University, China
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:Metric learning  Pairwise constraint  Closure centroid  Semi-supervised clustering
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号