Sciweavers

Share
IPL
2007

Optimal implementations of UPGMA and other common clustering algorithms

11 years 1 months ago
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.
Ilan Gronau, Shlomo Moran
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IPL
Authors Ilan Gronau, Shlomo Moran
Comments (0)
books