|
篇目详细内容 |
|
【篇名】 |
Distance metric learning guided adaptive subspace semi-supervised clustering |
|
【刊名】 |
Frontiers of Computer Science in China |
|
【刊名缩写】 |
Front. Comput. Sci. China |
|
【ISSN】 |
1673-7350 |
|
【EISSN】 |
1673-7466 |
|
【DOI】 |
10.1007/s11704-010-0376-9 |
|
【出版社】 |
Higher Education Press and Springer-Verlag Berlin
Heidelberg |
|
【出版年】 |
2011 |
|
【卷期】 |
5
卷1期 |
|
【页码】 |
100-108
页,共
9
页 |
|
【作者】 |
Xuesong YIN;
Enliang HU;
|
|
【关键词】 |
semi-supervise clustering; pairwise constraint; distance metric learning; data mining |
【摘要】 |
|
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. |
