PPT-Clustering Lecture outline

DistanceSimilarity between data objects Data objects as geometric data points Clustering problems and algorithms Kmeans Kmedian Kcenter What is clustering A grouping of data objects such that the objects . x and want to group the data into a few cohesive clusters Here as usual but no labels are given So this is an unsupervised learning problem The means clustering algorithm is as follows 1 Initialize cluster centroids 57525 57525 randomly 2 Repeat u 1 All figures are courtesy of Athena Scientific and are used with permission brPage 2br SOME MATH CONVENTIONS All of our work is done in space of tuples x All vectors are assumed column vectors denotes transpose so we use to denote a row vector is Density-based clustering (DB-Scan). Reference: Martin Ester, Hans-Peter . Kriegel. , . Jorg. Sander, . Xiaowei. . Xu. : A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. KDD 2006. : Distributed Co-clustering with Map-Reduce. S. Papadimitriou, J. Sun. IBM T.J. Watson Research Center. Speaker:. 0356169. 吳宏君. 0350741. . 陳威遠. 0356042 . 洪浩哲. Outline. Introduction. April 22, 2010. Last Time. GMM Model Adaptation. MAP (Maximum A Posteriori). MLLR (Maximum Likelihood Linear Regression). UMB-. MAP. for speaker recognition. Today. Graph Based Clustering. Minimum Cut. Lecture outline. Distance/Similarity between data objects. Data objects as geometric data points. Clustering problems and algorithms . K-means. K-median. K-center. What is clustering?. A . grouping. of data objects such that the objects . issue in . computing a representative simplicial complex. . Mapper does . not place any conditions on the clustering . algorithm. Thus . any domain-specific clustering algorithm can . be used.. We . What is clustering?. Why would we want to cluster?. How would you determine clusters?. How can you do this efficiently?. K-means Clustering. Strengths. Simple iterative method. User provides “K”. Unsupervised . learning. Seeks to organize data . into . “reasonable” . groups. Often based . on some similarity (or distance) measure defined over data . elements. Quantitative characterization may include. Lecture outline. Distance/Similarity between data objects. Data objects as geometric data points. Clustering problems and algorithms . K-means. K-median. K-center. What is clustering?. A . grouping. of data objects such that the objects . 1. Mark Stamp. K-Means for Malware Classification. Clustering Applications. 2. Chinmayee. . Annachhatre. Mark Stamp. Quest for the Holy . Grail. Holy Grail of malware research is to detect previously unseen malware. Log. 2. transformation. Row centering and normalization. Filtering. Log. 2. Transformation. Log. 2. -transformation makes sure that the noise is independent of the mean and similar differences have the same meaning along the dynamic range of the values.. Randomization tests. Cluster Validity . All clustering algorithms provided with a set of points output a clustering. How . to evaluate the “goodness” of the resulting clusters?. Tricky because . Introduction to Data Mining, 2. nd. Edition. by. Tan, Steinbach, Karpatne, Kumar. Two Types of Clustering. Hierarchical. Partitional algorithms:. Construct various partitions and then evaluate them by some criterion.