Hierarchical Clustering University of Connecticut次聚类康涅狄格大学.pptVIP

Hierarchical Clustering Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram A tree like diagram that records the sequences of merges or splits Strengths of Hierarchical Clustering Do not have to assume any particular number of clusters Any desired number of clusters can be obtained by ‘cutting’ the dendogram at the proper level They may correspond to meaningful taxonomies Example in biological sciences Hierarchical Clustering Two main types of hierarchical clustering Agglomerative: Start with the points as individual clusters At each step, merge the closest pair of clusters until only one cluster (or k clusters) left Divisive: Start with one, all-inclusive cluster At each step, split a cluster until each cluster contains a point (or there are k clusters) Traditional hierarchical algorithms use a similarity or distance matrix Merge or split one cluster at a time Agglomerative Clustering Algorithm More popular hierarchical clustering technique Basic algorithm is straightforward Compute the proximity matrix Let each data point be a cluster Repeat Merge the two closest clusters Update the proximity matrix Until only a single cluster remains Key operation is the computation of the proximity of two clusters Different approaches to defining the distance between clusters distinguish the different algorithms Starting Situation Start with clusters of individual points and a proximity matrix Intermediate Situation After some merging steps, we have some clusters Intermediate Situation We want to merge the two closest clusters (C2 and C5) and update the proximity matrix. After Merging The question is “How do we update the proximity matrix?” How to Define Inter-Cluster Similarity How to Define Inter-Cluster Similarity How to Define Inter-Cluster Similarity How to Define Inter-Cluster Similarity How to Define Inter-Cluster Similarity Cluster Similarity: MIN or Single Link Similarity of two cluster