PPT-1 Clustering: K-Means

Machine Learning 10601 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. Margareta Ackerman. Work with . Shai. Ben-David, . Simina. . Branzei. , and David . Loker. . Clustering is one of the most widely used tools for exploratory data analysis.. . Social Sciences. Biology. Basic Concepts and Algorithms. Bamshad Mobasher. DePaul University. 2. What is Clustering in Data Mining?. Cluster:. a collection of data objects that are “similar” to one another and thus can be treated collectively as one group. 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. CSC 575. Intelligent Information Retrieval. Intelligent Information Retrieval. 2. Clustering Techniques and IR. Today. Clustering Problem and Applications. Clustering Methodologies and Techniques. Applications of Clustering in IR. Margareta Ackerman. Work with . Shai. Ben-David, . Simina. . Branzei. , and David . Loker. . Clustering is one of the most widely used tools for exploratory data analysis.. . Social Sciences. Biology. 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. Margareta Ackerman. Work with . Shai. Ben-David, . Simina. . Branzei. , and David . Loker. . Clustering is one of the most widely used tools for exploratory data analysis.. . Social Sciences. Biology. Suresh Merugu, IITR. Overview. Definition of Clustering. Existing Clustering Methods. Clustering Examples. Classification. Classification Examples. Cluster. : A collection of data objects. Similar to one another within the same cluster. Fuzzy . k. -means. Self-organizing maps. Evaluation of clustering results. Figures and equations from Data Clustering by . Gan. et al.. Center-based clustering. Have objective functions which define how good a solution is;. 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 . 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. 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. clusters. CS771: Introduction to Machine Learning. Nisheeth. K. -means algorithm: . recap. 2. Notation: . or . is a . -dim one-hot vector. (. = 1 and . mean the same).  . K-means loss function: recap.