论文标题
树状图的最弱的链接修剪
Weakest link pruning of a dendrogram
论文作者
论文摘要
分层聚类是一种识别数据集中不同组的流行方法。修剪树状图最常用的方法是通过单个水平切割。在本文中，我们提出了一种新技术“最弱的链接最佳修剪”。我们证明了它优于水平修剪，并提供了一些示例，说明了两种方法的行为如何完全不同。
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.
