Current Slide

CHAMELEON: Hierarchical Clustering Using Dynamic Modeling (1999)

• CHAMELEON: G. Karypis, E. H. Han, and V. Kumar, 1999
• Measures the similarity based on a dynamic model
• Two clusters are merged only if the interconnectivity and closeness (proximity) between two clusters are high relative to the internal interconnectivity of the clusters and closeness of items within the clusters
• Graph-based, and a two-phase algorithm
• Use a graph-partitioning algorithm: cluster objects into a large number of relatively small sub-clusters
• Use an agglomerative hierarchical clustering algorithm: find the genuine clusters by repeatedly combining these sub-clusters