Journal
INFORMATION PROCESSING LETTERS
Volume 104, Issue 6, Pages 205-210Publisher
ELSEVIER
DOI: 10.1016/j.ipl.2007.07.002
Keywords
hierarchical clustering; UPGMA; design of algorithms; input-output specification; computational complexity
Categories
Ask authors/readers for more resources
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n(2))-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'). (C) 2007 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
