Recovering a metric from its full ordinal information

DOI10.1007/S00454-022-00452-2OpenAlexW4308210934MaRDI QIDQ2679599FDOQ2679599

Authors: Thibaut Le Gouic 

Publication date: 23 January 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-022-00452-2

Recommendations

• Ordinal and ordered metric unfolding models
• Finding the optimal metric in classification problems with ordinal features
• Metrizable ordinal proximity measures and their aggregation
• Metric methods for analyzing partially ranked data
• On order-preserving properties of probability metrics
• AN ORDINAL INFORMATION RETRIEVAL MODEL
• Functorial scaling of ordinal data
• An abstract domain to infer ordinal-valued ranking functions

zbMATH Keywords

convergencegeodesic spaceratesordinal information

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Combinatorial complexity of geometric structures (52C45) Metric geometry (51F99)

Cites Work

• Computational optimal transport. With applications to data sciences
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Optimal Transport
• Multidimensional scaling. I: Theory and method
• A course in metric geometry
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
• Some theory for ordinal embedding

This page was built for publication: Recovering a metric from its full ordinal information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679599)