Algorithms for metric learning via contrastive embeddings
From MaRDI portal
Publication:5088977
Recommendations
Cites work
- scientific article; zbMATH DE number 2079367 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Approximation algorithms for embedding general metrics into trees
- Correlation clustering
- Distance metric learning for large margin nearest neighbor classification
- Euclidean distortion and the sparsest cut
- Excluded minors, network decomposition, and multicommodity flow
- Expander flows, geometric embeddings and graph partitioning
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- Geometric approximation algorithms
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- Metric clustering via consistent labeling
- Metric learning: a survey
- Monotone maps, sphericity and bounded second eigenvalue
- Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
- Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
- Quick approximation to matrices and applications
- Regularity Lemmas and Combinatorial Algorithms
- The geometry of graphs and some of its algorithmic applications
- Unit disk graph recognition is NP-hard
Cited in
(6)- Metric Learning via Cross-Validation
- Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
- Deep metric learning using triplet network
- scientific article; zbMATH DE number 7758347 (Why is no real title available?)
- LogDet Divergence-Based Metric Learning With Triplet Constraints and Its Applications
- Metric Learning
This page was built for publication: Algorithms for metric learning via contrastive embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088977)