Spotlight Poster

Hierarchical clustering with dot products recovers hidden tree structure

Annie Gray · Alexander Modell · Patrick Rubin-Delanchy · Nick Whiteley

Great Hall & Hall B1+B2 (level 1) #1017
[ ]
Tue 12 Dec 3:15 p.m. PST — 5:15 p.m. PST


In this paper we offer a new perspective on the well established agglomerative clustering algorithm, focusing on recovery of hierarchical structure. We recommend a simple variant of the standard algorithm, in which clusters are merged by maximum average dot product and not, for example, by minimum distance or within-cluster variance. We demonstrate that the tree output by this algorithm provides a bona fide estimate of generative hierarchical structure in data, under a generic probabilistic graphical model. The key technical innovations are to understand how hierarchical information in this model translates into tree geometry which can be recovered from data, and to characterise the benefits of simultaneously growing sample size and data dimension. We demonstrate superior tree recovery performance with real data over existing approaches such as UPGMA, Ward's method, and HDBSCAN.

Chat is not available.