Research map / Learning theory and algorithms / Clustering
Flattening a Hierarchical Clustering through Active Learning
Fabio Vitale, Anand Rajagopalan, Claudio Gentile
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 N-WDP instead of NR | Active learning on complete-linkage MNIST · MNIST, complete linkage, 250 queries | test set accuracy: 9.52% vs. 10.1% | Improved |
| Use N-WDP rather than passive ERM | Active learning on MNIST hierarchies · MNIST, single, median, and complete linkage | test set accuracy | Improved |
| Use breadth-first search rather than N-WDP | Active learning on MNIST hierarchies · MNIST hierarchies where the best cut has few clusters | test set accuracy | Mixed |
| Use NR rather than passive ERM | Active learning on MNIST hierarchies · MNIST, single, median, and complete linkage | test set accuracy | Mixed |
Closest papers by meaning
- Learning-Augmented Hierarchical Clustering (ICML 2025 · similarity 0.88)
- Robust Offline Active Learning on Graphs (NeurIPS 2024 · similarity 0.86)
- Ultrametric Cluster Hierarchies: I Want ‘em All! (NeurIPS 2025 · similarity 0.85)
- Classification Fields: Arbitrarily Fine Recursive Hierarchical Clustering From Few Examples (NeurIPS 2026 · similarity 0.85)
- Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees (ICML 2025 · similarity 0.85)
- Algorithms and Hardness for Active Learning on Graphs (ICML 2025 · similarity 0.85)
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.
