New bounds on the cohesion of complete-link and other linkage methods for agglomeration clustering

arXiv:2405.00937v1 Announce Type: new
Abstract: Linkage methods are among the most popular algorithms for hierarchical clustering. Despite their relevance the current knowledge regarding the quality of the clustering produced by these methods is limited. Here, we improve the currently available bounds on the maximum diameter of the clustering obtained by complete-link for metric spaces.
One of our new bounds, in contrast to the existing ones, allows us to separate complete-link from single-link in terms of approximation for the diameter, which …

abstract algorithms arxiv clustering cs.ds cs.lg current hierarchical knowledge maximum popular quality stat.ml type