Research map / Learning theory and algorithms / Clustering

From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clustering

NeurIPS 2020 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Closest papers by meaning

• Classification Fields: Arbitrarily Fine Recursive Hierarchical Clustering From Few Examples (NeurIPS 2026 · similarity 0.88)
• Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchy (ICLR 2025 · similarity 0.88)
• Hierarchical Correlation Clustering and Tree Preserving Embedding (CVPR 2024 · similarity 0.88)
• Expected Probabilistic Hierarchies (NeurIPS 2024 · similarity 0.88)
• Low-distortion and GPU-compatible Tree Embeddings in Hyperbolic Space (ICML 2025 · similarity 0.87)
• Learning-Augmented Hierarchical Clustering (ICML 2025 · similarity 0.87)