人工智能与数据挖掘lect513章节幻灯片.pptVIP

* * Summary: Requirements of Clustering Algorithm Scalability Ability to deal with different types of attributes Discovery of clusters with arbitrary (任意的) shape Minimal requirements for domain knowledge to determine input parameters Ability to deal with noisy data Insensitivity to order of input records High dimensionality Incorporation of user-specified constraints Interpretability and usability * AIDM BUPT * Challenges Further Research Considerable progress has been made in scalable clustering methods Partitioning: k-means, k-medoids, CLARANS Hierarchical: BIRCH, CURE Density-based: DBSCAN, CLIQUE, OPTICS Grid-based: STING, WaveCluster Model-based: Autoclass, Denclue, Cobweb Current clustering techniques do not address all the requirements adequately * AIDM BUPT * Homework Perform the third iteration of the k-means algorithm for the example given in the section “An Example Using K-Means”. What are the new cluster centers? Suppose that the data mining task is to cluster the following 8 points (with (x,y) representing location) into 3 clusters. A1(2,10), A2(2,5), A3(8,4), B1(5,8), B2(7,5), B3(6,4), C1(1,2), C2(4,9) The distance function is Manhattan distance. Suppose initially we assign A1, B1, and C1 as the center of each cluster, respectively. Use the k-means algorithm to show only: (a) the three cluster centers after the first round execution; (b) the final three clusters. * AIDM BUPT * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Chapter 3 Basic Data Mining Techniques 3.3 The K-Means Algorithm (For cluster analysis) * AIDM BUPT * 1. What is Cluster Analysis (clustering) ? Cluster (簇): a collection of data objects Similar to one another within the same cluster Dissimilar to the objects in other clusters High quality clusters: high intra-class similarity low inter-class similarity Cluster analysis (聚类分析) Grouping a set of data objects into clusters Clustering is unsupervised learning (unsupervised classification): no predefined classes. It is a