Weakest link pruning of a dendrogram
Jiacheng Ge, Robert Tibshirani
TL;DR
This paper introduces 'weakest link optimal pruning', a novel method for dendrogram pruning in hierarchical clustering, demonstrating its advantages over traditional horizontal cuts through theoretical proof and illustrative examples.
Contribution
The paper presents a new pruning technique for dendrograms that outperforms the standard horizontal cut method, supported by theoretical proof and practical examples.
Findings
Weakest link pruning is superior to horizontal pruning.
The method can behave differently and more effectively in certain datasets.
Theoretical proof supports the advantages of the new technique.
Abstract
Hierarchical clustering is a popular method for identifying distinct groups in a dataset. The most commonly used method for pruning a dendrogram is via a single horizontal cut. In this paper, we propose a new technique "weakest link optimal pruning". We prove its superiority over horizontal pruning and provide some examples illustrating how the two methods can behave quite differently.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Advanced Clustering Algorithms Research · Video Analysis and Summarization