Modern hierarchical, agglomerative clustering algorithms

Details Modern hierarchical, agglomerative clustering algorithms Modern hierarchical, agglomerative clustering algorithms

2011-09-12

arxiv.org/abs/1109.2378v1

Statistics

Machine Learning

29 pages

Scientific paper

This paper presents algorithms for hierarchical, agglomerative clustering which perform most efficiently in the general-purpose setup that is given in modern standard software. Requirements are: (1) the input data is given by pairwise dissimilarities between data points, but extensions to vector data are also discussed (2) the output is a "stepwise dendrogram", a data structure which is shared by all implementations in current standard software. We present algorithms (old and new) which perform clustering in this setting efficiently, both in an asymptotic worst-case analysis and from a practical point of view. The main contributions of this paper are: (1) We present a new algorithm which is suitable for any distance update scheme and performs significantly better than the existing algorithms. (2) We prove the correctness of two algorithms by Rohlf and Murtagh, which is necessary in each case for different reasons. (3) We give well-founded recommendations for the best current algorithms for the various agglomerative clustering schemes.

Affiliated with

Also associated with

No associations

Rating

Modern hierarchical, agglomerative clustering algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modern hierarchical, agglomerative clustering algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modern hierarchical, agglomerative clustering algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-59497