Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
From MaRDI portal
Publication:2369641
Recommendations
- Algorithms for metric learning via contrastive embeddings
- Positive semidefinite metric learning using boosting-like algorithms
- scientific article; zbMATH DE number 5957283
- Semi-supervised distance metric learning in high-dimensional spaces by using equivalence constraints
- Constrained Metric Learning by Permutation Inducing Isometries
- Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
Cited in
(9)- scientific article; zbMATH DE number 5957283 (Why is no real title available?)
- Distance metric learning guided adaptive subspace semi-supervised clustering
- Semi-supervised clustering with metric learning: an adaptive kernel method
- Ordinal margin metric learning and its extension for cross-distribution image data
- Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
- Supervised distance metric learning through maximization of the Jeffrey divergence
- Supervised principal component analysis: visualization, classification and regression on subspaces and submanifolds
- Learning a Mahalanobis distance metric for data clustering and classification
- A Novel Semi-supervised Clustering Algorithm for Finding Clusters of Arbitrary Shapes
This page was built for publication: Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369641)
