  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.
