Presentation is loading. Please wait.

Presentation is loading. Please wait.

K-means Ask user how many clusters they’d like. (e.g. k=5) Copyright © 2001, 2004, Andrew W. Moore.

Published byYandi Budiman Modified over 6 years ago

Similar presentations

Presentation on theme: "K-means Ask user how many clusters they’d like. (e.g. k=5) Copyright © 2001, 2004, Andrew W. Moore."— Presentation transcript:

1

2

3

4

5

6

7

8

9

10

11 K-means Ask user how many clusters they’d like. (e.g. k=5)
Copyright © 2001, 2004, Andrew W. Moore

12 K-means Ask user how many clusters they’d like. (e.g. k=5)
Randomly guess k cluster Center locations Copyright © 2001, 2004, Andrew W. Moore

13 K-means Ask user how many clusters they’d like. (e.g. k=5)
Randomly guess k cluster Center locations Each datapoint finds out which Center it’s closest to. (Thus each Center “owns” a set of datapoints) Copyright © 2001, 2004, Andrew W. Moore

14 K-means Ask user how many clusters they’d like. (e.g. k=5)
Randomly guess k cluster Center locations Each datapoint finds out which Center it’s closest to. Each Center finds the centroid of the points it owns Copyright © 2001, 2004, Andrew W. Moore

15 K-means Ask user how many clusters they’d like. (e.g. k=5)
Randomly guess k cluster Center locations Each datapoint finds out which Center it’s closest to. Each Center finds the centroid of the points it owns… …and jumps there …Repeat until terminated! Copyright © 2001, 2004, Andrew W. Moore

16 K-means Start Advance apologies: in Black and White this example will deteriorate Example generated by Dan Pelleg’s super-duper fast K-means system: Dan Pelleg and Andrew Moore. Accelerating Exact k-means Algorithms with Geometric Reasoning. Proc. Conference on Knowledge Discovery in Databases 1999, (KDD99) (available on Copyright © 2001, 2004, Andrew W. Moore

17 K-means continues… Copyright © 2001, 2004, Andrew W. Moore

18 K-means continues… Copyright © 2001, 2004, Andrew W. Moore

19 K-means continues… Copyright © 2001, 2004, Andrew W. Moore

20 K-means continues… Copyright © 2001, 2004, Andrew W. Moore

21 K-means continues… Copyright © 2001, 2004, Andrew W. Moore

22 K-means continues… Copyright © 2001, 2004, Andrew W. Moore

23 K-means continues… Copyright © 2001, 2004, Andrew W. Moore

24 K-means continues… Copyright © 2001, 2004, Andrew W. Moore

25 K-means terminates Copyright © 2001, 2004, Andrew W. Moore

Download ppt "K-means Ask user how many clusters they’d like. (e.g. k=5) Copyright © 2001, 2004, Andrew W. Moore."

Similar presentations

Data Set used. K Means K Means Clusters 1.K Means begins with a user specified amount of clusters 2.Randomly places the K centroids on the data set 3.Finds.

Data Set used. K Means K Means Clusters 1.K Means begins with a user specified amount of clusters 2.Randomly places the K centroids on the data set 3.Finds.
K-means Clustering Ke Chen.

K-means Clustering Ke Chen.
Data Mining Tools Overview Business Intelligence for Managers.

Data Mining Tools Overview Business Intelligence for Managers.
Incremental Clustering Previous clustering algorithms worked in “batch” mode: processed all points at essentially the same time. Some IR applications cluster.

Incremental Clustering Previous clustering algorithms worked in “batch” mode: processed all points at essentially the same time. Some IR applications cluster.
K Means Clustering , Nearest Cluster and Gaussian Mixture

K Means Clustering , Nearest Cluster and Gaussian Mixture
K-means clustering Hongning Wang CS@UVa.

K-means clustering Hongning Wang
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 1- 1.

Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 1- 1.
Unsupervised Learning: Clustering Rong Jin Outline  Unsupervised learning  K means for clustering  Expectation Maximization algorithm for clustering.

Unsupervised Learning: Clustering Rong Jin Outline  Unsupervised learning  K means for clustering  Expectation Maximization algorithm for clustering.
Data Mining Lectures Lecture 9,10: Clustering Padhraic Smyth, UC Irvine ICS 278: Data Mining Lecture 9,10: Clustering Algorithms Padhraic Smyth Department.

Data Mining Lectures Lecture 9,10: Clustering Padhraic Smyth, UC Irvine ICS 278: Data Mining Lecture 9,10: Clustering Algorithms Padhraic Smyth Department.
Unsupervised Learning: Clustering Some material adapted from slides by Andrew Moore, CMU. Visit for

Unsupervised Learning: Clustering Some material adapted from slides by Andrew Moore, CMU. Visit for
Scalable Data Mining The Auton Lab, Carnegie Mellon University www.autonlab.org Brigham Anderson, Andrew Moore, Dan Pelleg, Alex Gray, Bob Nichols, Andy.

Scalable Data Mining The Auton Lab, Carnegie Mellon University Brigham Anderson, Andrew Moore, Dan Pelleg, Alex Gray, Bob Nichols, Andy.
“Compiler and Runtime Support for Enabling Generalized Reduction Computations on Heterogeneous Parallel Computations” By Ravi, Ma, Chiu, & Agrawal Presented.

“Compiler and Runtime Support for Enabling Generalized Reduction Computations on Heterogeneous Parallel Computations” By Ravi, Ma, Chiu, & Agrawal Presented.
Contrast Enhancement Crystal Logan Mentored by: Dr. Lucia Dettori Dr. Jacob Furst.

Contrast Enhancement Crystal Logan Mentored by: Dr. Lucia Dettori Dr. Jacob Furst.
Switch to Top-down Top-down or move-to-nearest Partition documents into ‘k’ clusters Two variants “Hard” (0/1) assignment of documents to clusters “soft”

Switch to Top-down Top-down or move-to-nearest Partition documents into ‘k’ clusters Two variants “Hard” (0/1) assignment of documents to clusters “soft”
K-means Clustering. What is clustering? Why would we want to cluster? How would you determine clusters? How can you do this efficiently?

K-means Clustering. What is clustering? Why would we want to cluster? How would you determine clusters? How can you do this efficiently?
ECE 5984: Introduction to Machine Learning

ECE 5984: Introduction to Machine Learning
Copyright © 2003 Pearson Education, Inc. Slide 1-1 1.2 Radian Measure, Arc Length, and Area Another way to measure angles is using what is called radians.

Copyright © 2003 Pearson Education, Inc. Slide Radian Measure, Arc Length, and Area Another way to measure angles is using what is called radians.
Health and CS Philip Chan. DNA, Genes, Proteins What is the relationship among DNA Genes Proteins ?

Health and CS Philip Chan. DNA, Genes, Proteins What is the relationship among DNA Genes Proteins ?
Utilising software to enhance your research Eamonn Hynes 5 th November, 2012.

Utilising software to enhance your research Eamonn Hynes 5 th November, 2012.
Kansas State University Department of Computing and Information Sciences KDD Group Presentation #7 Fall’01 Friday, November 9, 2001 Cecil P. Schmidt Department.

Kansas State University Department of Computing and Information Sciences KDD Group Presentation #7 Fall’01 Friday, November 9, 2001 Cecil P. Schmidt Department.

Similar presentations

Ads by Google