Learning-Augmented Hierarchical Clustering
Vladimir Braverman, Jon C. Ergun, Chen Wang, Samson Zhou
摘要
In this chapter, we only consider hierarchies that are binary trees like the one shown in Figure 17.1 -but hierarchical clustering can be easily extended to other types of trees.
问 Lune
尽管问，回答会引用原文。
Lune 会读完全文和相关的 Paper，每个回答都附上所依据的原文段落。
引用它的顶会 Paper6
- Learning-Augmented Moment Estimation on Time-Decay ModelsSoham Nagawanshi, Shalini Panthangi, Chen Wang, David P. Woodruff 等ICLR 2026 · 3 次引用
- Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data StreamsVincent Cohen-Addad, David P. Woodruff, Shenghao Xie, Samson ZhouICLR 2026 · 2 次引用
- Relative Error Fair Clustering in the Weak-Strong Oracle ModelVladimir Braverman, Prathamesh Dharangutte, Shaofeng H.-C. Jiang, Hoai-An Nguyen 等ICML 2025
- Metric -clustering using only Weak Comparison OraclesRahul Raychaudhury, Aryan Esmailpour, Sainyam Galhotra, Stavros SintosICLR 2026
- Universal Guideline-Driven Image Clustering via a Hybrid LLM AgentWenliang Zhong, Rob Barton, Lucas Goncalves, Kushal Kumar 等CVPR 2026
相关 Paper
- Ultrametric Cluster Hierarchies: I Want 'em All!Andrew Draganov, Pascal Weber, Rasmus Skibdahl Melanchton Jørgensen, Anna Beer 等NeurIPS 2025
- Hierarchical clustering with dot products recovers hidden tree structureAnnie Gray, Alexander Modell, Patrick Rubin-Delanchy, Nick WhiteleyNeurIPS 2023 · 3 次引用
- Hierarchical Correlation Clustering and Tree Preserving EmbeddingMorteza Haghir Chehreghani, Mostafa Haghir ChehreghaniCVPR 2024
- Learning Hierarchical Cluster Structure of Graphs in Sublinear TimeMichael Kapralov, Akash Kumar, Silvio Lattanzi, Aida MousavifarSODA 2023 · 2 次引用
- Nearly-Optimal Hierarchical Clustering for Well-Clustered GraphsSteinar Laenen, Bogdan-Adrian Manghiuc, He SunICML 2023 · 8 次引用
