Distance metric learning guided adaptive subspace semi-supervised clustering

Authors:
Xuesong Yin;Enliang Hu
Affiliations:
Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China 210016 and Department of Computer Science & Technology, Zhejiang Radio and TV Uni ...;Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China 210016
Venue:
Frontiers of Computer Science in China
Year:
2011

Citing 11
Cited 0

PCA versus LDA

IEEE Transactions on Pattern Analysis and Machine Intelligence
Convergence of a block coordinate descent method for nondifferentiable minimization

Journal of Optimization Theory and Applications
Constrained K-means Clustering with Background Knowledge

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
A probabilistic framework for semi-supervised clustering

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Integrating constraints and metric learning in semi-supervised clustering

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Rapid and brief communication: Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints

Pattern Recognition
Adaptive dimension reduction using discriminant analysis and K-means clustering

Proceedings of the 24th international conference on Machine learning
Enhancing semi-supervised clustering: a feature projection perspective

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Learning a Mahalanobis distance metric for data clustering and classification

Pattern Recognition
Clustering with local and global regularization

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A Kernel Approach for Semisupervised Metric Learning

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

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.