Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
From MaRDI portal
Recommendations
- Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
- Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics
- Low-distortion embeddings of general metrics into the line
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
Cited in
(12)- Betweenness parameterized above tight lower bound
- Geometric representations of dichotomous ordinal data
- Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics
- scientific article; zbMATH DE number 4007499 (Why is no real title available?)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
- Algorithms for metric learning via contrastive embeddings
- Some theory for ordinal embedding
- Lens depth function and \(k\)-relative neighborhood graph: versatile tools for ordinal data analysis
- scientific article; zbMATH DE number 7758347 (Why is no real title available?)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Embedding graphs as Euclidean kNN-graphs
This page was built for publication: Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541784)
