Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
- 31 August 2010
- journal article
- Published by Elsevier BV in Pattern Recognition
- Vol. 43 (8), 2982-2992
- https://doi.org/10.1016/j.patcog.2010.02.022
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Learning a Mahalanobis distance metric for data clustering and classificationPattern Recognition, 2008
- Mixture Modeling with Pairwise, Instance-Level Class ConstraintsNeural Computation, 2005
- Model-based Clustering With Probabilistic ConstraintsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2005
- Semi-supervised graph clusteringPublished by Association for Computing Machinery (ACM) ,2005
- A probabilistic framework for semi-supervised clusteringPublished by Association for Computing Machinery (ACM) ,2004
- Correlation ClusteringMachine Learning, 2004
- Segmentation given partial grouping constraintsIeee Transactions On Pattern Analysis and Machine Intelligence, 2004
- Integrating constraints and metric learning in semi-supervised clusteringPublished by Association for Computing Machinery (ACM) ,2004
- Boosting margin based distance functions for clusteringPublished by Association for Computing Machinery (ACM) ,2004
- Discriminant adaptive nearest neighbor classificationIeee Transactions On Pattern Analysis and Machine Intelligence, 1996