PPT-Clustering: Partition 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 . Adapted from Chapter 3. Of. Lei Tang and . Huan. Liu’s . Book. Slides prepared by . Qiang. Yang, . UST, . HongKong. 1. Chapter 3, Community Detection and Mining in Social Media.  Lei Tang and Huan Liu, Morgan & Claypool, September, 2010. . 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. Keep Your System on the Road. David Kurtz. Go-Faster Consultancy Ltd.. david.kurtz@go-faster.co.uk. www.go-faster.co.uk. Who Am I?. Oracle Database Specialist. Independent consultant. Performance tuning. shan@cs.unc.edu. Clustering Techniques and Applications to Image Segmentation. Roadmap. Unsupervised learning. Clustering categories. Clustering algorithms. K-means. Fuzzy c-means. Kernel-based . Graph-based. Ensemble Clustering. unlabeled . data. ……. F. inal . partition. clustering algorithm 1. combine. clustering algorithm . N. ……. clustering algorithm 2. Combine multiple partitions of . given. data . Machine . Learning . 10-601. , Fall . 2014. Bhavana. . Dalvi. Mishra. PhD student LTI, CMU. Slides are based . on materials . from . Prof. . Eric Xing, Prof. . . William Cohen and Prof. Andrew Ng. Jiri. . Matousek. . Presented By. Benny Schlesinger. Omer Tavori. 1. Simplex Range Searching. Simplex range searching: We preprocess . a set P of n points in so that, given any query region . M. Soltanolkotabi E.Elhamifar E.J. Candes. 报告. 人：万晟、元玉慧. 、. 张. 驰. 昱. 信息科学与技术学院. 智. 能科学系. 1. Main Contribution. Existing work. Subspace Clustering. Sushmita Roy. sroy@biostat.wisc.edu. Computational Network Biology. Biostatistics & Medical Informatics 826. Computer Sciences 838. https://compnetbiocourse.discovery.wisc.edu. Nov 3. rd. 2016. RECAP. Gandhi, INC, Muslim League, British and the Indian people. Partition : Aug 14-15 1947. WHY study partition? . Because it shapes politics, state, and society of contemporary India. WHAT was it?. Numbers. 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”. 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 . 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 . succinic. acid. Theory: . Consider a system consisting of two liquid layers (phases) of two immiscible or slightly miscible liquid. If a third substance ,. Which is soluble in both liquids, is added into the system it is found to distribute ,or divide, itself between the two layer in a definite manner .It has been shown experimentally that at equilibrium, at constant temperature ,the ratio of the concentrations in the layers has a definite value. If C1 and C2 are the concentrations of this substance in two layers ,then:.