Optimal implementations of UPGMA and other common clustering algorithms

In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’). © 2007 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2007
• Where: IPL
• Authors: Ilan Gronau, Shlomo Moran
• Keywords: Closest-pair Joining Scheme, Hierarchical Clustering Algorithms, IPL 2007, Joining Scheme