Research map / Graph learning / Graph algorithms and clustering
Lens Depth Function and k-Relative Neighborhood Graph: Versatile Tools for Ordinal Data Analysis
Matthäus Kleindessner, Ulrike von Luxburg
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use lens-depth medoid algorithm instead of ordinal embedding (SOE or t-STE) | Medoid estimation · 100 points N_2(0,I_2), all statements, errorprob=0 | running time: 10 seconds to 141 seconds -> 0.01 seconds | Improved |
| use lens-depth algorithm instead of ordinal embedding when statements are noisy (errorprob=0.3, embedding dimension five) | Medoid estimation · 100 points N_2(0,I_2) | relative error | Improved |
| use ordinal embedding instead of lens-depth algorithm with only correct statements | Medoid estimation · 100 points N_2(0,I_2), errorprob=0 | relative error | Improved |
| use lens-depth algorithm instead of competing statement-based method | Medoid estimation · 100 points N_2(0,I_2) | relative error | Improved |
| switch from uniform sampling to Sampling II of statements (ablation) | Lens-depth medoid algorithm · 100 points N_2(0,I_2) | relative error | No clear effect |
| increase data dimension to 20 with noisy statements | Ordinal embedding vs lens-depth algorithm · 100 points N_20(0,I_20), errorprob=0.3, few statements | relative error | Improved |
Closest papers by meaning
- An Ordinal Data Clustering Algorithm with Automated Distance Learning (AAAI 2020 · similarity 0.86)
- Finite Sample Prediction and Recovery Bounds for Ordinal Embedding (NeurIPS 2016 · similarity 0.85)
- Low-Distortion Clustering with Ordinal and Limited Cardinal Information (AAAI 2024 · similarity 0.82)
- Kernel Quantile Embeddings and Associated Probability Metrics (ICML 2025 · similarity 0.82)
- Metric Transforms and Low Rank Representations of Kernels for Fast Attention (NeurIPS 2024 · similarity 0.82)
- Beyond Kemeny Medians: Consensus Ranking Distributions. Definition, Properties and Statistical Learning (NeurIPS 2026 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
