Distance metric learning guided adaptive subspace semi-supervised clustering |
| |
Authors: | Xuesong Yin Enliang Hu |
| |
Affiliation: | 1. Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China; 2. Department of Computer Science & Technology, Zhejiang Radio and TV University, Hangzhou 310030, China |
| |
Abstract: | Most existing semi-supervised clustering algorithms are not designed for handling high-dimensional data. On the other hand, semi-supervised dimensionality reduction methods may not necessarily improve the clustering performance, due to the fact that the inherent relationship between subspace selection and clustering is ignored. In order to mitigate the above problems, we present a semi-supervised clustering algorithm using adaptive distance metric learning (SCADM) which performs semi-supervised clustering and distance metric learning simultaneously. SCADM applies the clustering results to learn a distance metric and then projects the data onto a low-dimensional space where the separability of the data is maximized. Experimental results on real-world data sets show that the proposed method can effectively deal with high-dimensional data and provides an appealing clustering performance. |
| |
Keywords: | semi-supervise clustering pairwise constraint distance metric learning data mining |
本文献已被 SpringerLink 等数据库收录! |
| 点击此处可从《Frontiers of Computer Science》浏览原始摘要信息 |
|
点击此处可从《Frontiers of Computer Science》下载全文 |