Similarity metric learning for a variable-kernel classifier
Neural Computation
Discriminant Adaptive Nearest Neighbor Classification
IEEE Transactions on Pattern Analysis and Machine Intelligence
Comparing images using color coherence vectors
MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
Content-Based Image Retrieval at the End of the Early Years
IEEE Transactions on Pattern Analysis and Machine Intelligence
Locally Adaptive Metric Nearest-Neighbor Classification
IEEE Transactions on Pattern Analysis and Machine Intelligence
Clustering based on conditional distributions in an auxiliary space
Neural Computation
Constrained K-means Clustering with Background Knowledge
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Semi-supervised Clustering by Seeding
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Clustering with Instance-level Constraints
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Adaptive Kernel Metric Nearest Neighbor Classification
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
Locally linear metric adaptation for semi-supervised clustering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Parametric distance metric learning with label information
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
An Optimal Global Nearest Neighbor Metric
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimization of k nearest neighbor density estimates
IEEE Transactions on Information Theory
The optimal distance measure for nearest neighbor classification
IEEE Transactions on Information Theory
Relevance feedback: a power tool for interactive content-based image retrieval
IEEE Transactions on Circuits and Systems for Video Technology
An active learning framework for semi-supervised document clustering with language modeling
Data & Knowledge Engineering
A global optimization method for semi-supervised clustering
Data Mining and Knowledge Discovery
Learning assignment order of instances for the constrained K-means clustering algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Semi-supervised metric learning using pairwise constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Kernel-based metric learning for semi-supervised clustering
Neurocomputing
Guided Locally Linear Embedding
Pattern Recognition Letters
Learning low-rank kernel matrices for constrained clustering
Neurocomputing
Two phase semi-supervised clustering using background knowledge
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Semi-supervised clustering with discriminative random fields
Pattern Recognition
Probabilistic non-linear distance metric learning for constrained clustering
Proceedings of the 4th MultiClust Workshop on Multiple Clusterings, Multi-view Data, and Multi-source Knowledge-driven Clustering
Hi-index | 0.01 |
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the conventional clustering problem called semi-supervised clustering, which performs clustering in the presence of some background knowledge or supervisory information expressed as pairwise similarity or dissimilarity constraints. However, existing metric learning methods for semi-supervised clustering mostly perform global metric learning through a linear transformation. In this paper, we propose a new metric learning method that performs nonlinear transformation globally but linear transformation locally. In particular, we formulate the learning problem as an optimization problem and present three methods for solving it. Through some toy data sets, we show empirically that our locally linear metric adaptation (LLMA) method can handle some difficult cases that cannot be handled satisfactorily by previous methods. We also demonstrate the effectiveness of our method on some UCI data sets. Besides applying LLMA to semi-supervised clustering, we have also used it to improve the performance of content-based image retrieval systems through metric learning. Experimental results based on two real-world image databases show that LLMA significantly outperforms other methods in boosting the image retrieval performance.