Cluster merging and splitting in hierarchical clustering algorithms

  • Authors:
  • Chris Ding;Xiaofeng He

  • Affiliations:
  • -;-

  • Venue:
  • ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hierarchical clustering constructs a hierarchy of clusterseither repeatedly mer in two smaller clusters into alarger one or splittin a larger cluster into smaller ones. The crucial step is how to best select the next cluster(s)to split or merge. Here we provide a comprehensiveanalysis of selection methods and propose several newmethods. We perform extensive clustering experimentsto test 8 selection methods, and ?nd that the averagesimilarity is the best method in divisive clustering andMinMax linkage is the best in agglomerativeCluster balance is a key factor to achieve goodperformance. We also introduce the concept of objective function saturation and clustering target distanceto effectively assess the quality of clustering.