聚类ki2-s7-clustering-algorithms.pptVIP

What is Clustering? The Goals of Clustering Determine the intrinsic grouping in a set of unlabeled data. What constitutes a good clustering? All clustering algorithms will produce clusters, regardless of whether the data contains them There is no golden standard, depends on goal: data reduction “natural clusters” “useful” clusters outlier detection Stages in clustering Taxonomy of Clustering Approaches Hierarchical Clustering Agglomerative clustering treats each data point as a singleton cluster, and then successively merges clusters until all points have been merged into a single remaining cluster. Divisive clustering works the other way around. Agglomerative Clustering Agglomerative Clustering Example – Single Link AC Example – Single Link AC Example – Single Link AC Example – Single Link AC Example – Single Link AC Example – Single Link AC Example – Single Link AC Example – Single Link AC Example – Single Link AC Example – Single Link AC Example – Single Link AC Taxonomy of Clustering Approaches Square error K-Means Step 0: Start with a random partition into K clusters Step 1: Generate a new partition by assigning each pattern to its closest cluster center Step 2: Compute new cluster centers as the centroids of the clusters. Step 3: Steps 1 and 2 are repeated until there is no change in the membership (also cluster centers remain the same) K-Means K-Means – How many K’s ? K-Means – How many K’s ? Locating the ‘knee’ Leader - Follower Online Specify threshold distance Find the closest cluster center Distance above threshold ? Create new cluster Or else, add instance to cluster Leader - Follower Find the closest cluster center Distance above threshold ? Create new cluster Or else, add instance to cluster Leader - Follower Find the closest cluster center Distance above threshold ? Create new cluster Or else, add instance to cluster and update cluster center Leader - Follower Find the closest cluster center Distance above thresho