Fast and effective text mining using linear-time document clustering
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
An introduction to nonlinear dimensionality reduction by maximum variance unfolding
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Multiple instance metric learning from automatically labeled bags of faces
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part I
Manifold elastic net: a unified framework for sparse dimension reduction
Data Mining and Knowledge Discovery
Subclass-Oriented dimension reduction with constraint transformation and manifold regularization
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
A boosting approach for supervised Mahalanobis distance metric learning
Pattern Recognition
Statistical Analysis and Data Mining
Integrating Spectral Kernel Learning and Constraints in Semi-Supervised Classification
Neural Processing Letters
Supervised patient similarity measure of heterogeneous patient records
ACM SIGKDD Explorations Newsletter
Clustering tagged documents with labeled and unlabeled documents
Information Processing and Management: an International Journal
A metric learning based approach to evaluate task-specific time series similarity
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Hi-index | 0.00 |
Distance metric learning is an old problem that has been researched in the supervised learning field for a very long time. In this paper, we consider the problem of learning a proper distance metric under the guidance of some weak supervisory information. Specifically, those information are in the form of pairwise constraints which specify whether a pair of data points are in the same class (must link constraints) or in the different classes (cannot link constraints). Given those constraints, our algorithm aims to learn a distance metric under which the points with must link constraints are pushed as close as possible, while simultaneously the points with cannot link constraints are pulled away as far as possible. Finally the experimental results are presented to show the effectiveness of our method.