Presentation is loading. Please wait.

Presentation is loading. Please wait.

AIM: Clustering the Data together

Published byKristin Barton Modified over 5 years ago

Similar presentations

Presentation on theme: "AIM: Clustering the Data together"— Presentation transcript:

1 AIM: Clustering the Data together
Clustering not dependent upon visible features Visible features example: fingerprints – whorls/archs/loops These are dependent upon the genetic formation People of similar regions may have similarity in terms of these features Thus clustering based on such features is biased

2 Letting the Data speak Collect the data samples from the test domain
Cluster the data based on some clustering algorithm

3 Clustering Algorithm used
K-means clustering Algorithm Algorithm in short: Start with a predefined number of clusters Initialize the clusters with a certain centroid Run the algorithm to associate each member point to a cluster Re-calculate the centroids

4 K-means clustering algorithm
Place K points into the space represented by the objects that are being clustered. These points represent initial group centroids. Assign each object to the group that has the closest centroid. When all objects have been assigned, recalculate the positions of the K centroids. Repeat Steps 2 and 3 until the centroids no longer move. This produces a separation of the objects into groups from which the metric to be minimized can be calculated.

5 Algorithm Evaluation Non-intuitive, yet true: Always Converges
Reason: finite number of ways of partitioning ‘R’ into ‘k’ groups Each time the configuration changes, we go to an improved distortion (sum of square error) Every iteration – new configuration If run forever, number of configurations exhaust

6 Algorithm Evaluation Convergence does not guarantee Optimality
To Assure a near-Optimal solution: Careful selection of starting points Several runs of the Algorithm

7 Selecting the starting points
Using the k-nearest neighbor concept ‘k’ corresponds to the number of clusters Find the global mean of the entire dataset Find the 'k' - closest data points to the global mean These 'k'-closest data samples are the initial 'k'- centroids.

8 The code so far….

9 References Statistical data mining Tutorial slides
Andrew Moore ( A Tutorial on clustering algorithms (

Download ppt "AIM: Clustering the Data together"

Similar presentations

Slide 1 EE3J2 Data Mining EE3J2 Data Mining Lecture 11: K-Means Clustering Martin Russell.

Slide 1 EE3J2 Data Mining EE3J2 Data Mining Lecture 11: K-Means Clustering Martin Russell.
K-means Clustering Ke Chen.

K-means Clustering Ke Chen.
K-MEANS ALGORITHM Jelena Vukovic 53/07

K-MEANS ALGORITHM Jelena Vukovic 53/07
Clustering Basic Concepts and Algorithms

Clustering Basic Concepts and Algorithms
PARTITIONAL CLUSTERING

PARTITIONAL CLUSTERING
Introduction to Bioinformatics

Introduction to Bioinformatics
Clustering… in General In vector space, clusters are vectors found within  of a cluster vector, with different techniques for determining the cluster.

Clustering… in General In vector space, clusters are vectors found within  of a cluster vector, with different techniques for determining the cluster.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.

© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Today Unsupervised Learning Clustering K-means. EE3J2 Data Mining Lecture 18 K-means and Agglomerative Algorithms Ali Al-Shahib.

Today Unsupervised Learning Clustering K-means. EE3J2 Data Mining Lecture 18 K-means and Agglomerative Algorithms Ali Al-Shahib.
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
Slide 1 EE3J2 Data Mining Lecture 16 Unsupervised Learning Ali Al-Shahib.

Slide 1 EE3J2 Data Mining Lecture 16 Unsupervised Learning Ali Al-Shahib.
Clustering Color/Intensity

Clustering Color/Intensity
Clustering.

Clustering.
Semi-Supervised Clustering Jieping Ye Department of Computer Science and Engineering Arizona State University

Semi-Supervised Clustering Jieping Ye Department of Computer Science and Engineering Arizona State University
1 Partitioning Algorithms: Basic Concepts  Partition n objects into k clusters Optimize the chosen partitioning criterion Example: minimize the Squared.

1 Partitioning Algorithms: Basic Concepts  Partition n objects into k clusters Optimize the chosen partitioning criterion Example: minimize the Squared.
Advanced Multimedia Text Clustering Tamara Berg. Reminder - Classification Given some labeled training documents Determine the best label for a test (query)

Advanced Multimedia Text Clustering Tamara Berg. Reminder - Classification Given some labeled training documents Determine the best label for a test (query)
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?
Clustering Ram Akella Lecture 6 February 23, 2011 1290& 280I University of California Berkeley Silicon Valley Center/SC.

Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
Evaluating Performance for Data Mining Techniques

Evaluating Performance for Data Mining Techniques
Unsupervised Learning. CS583, Bing Liu, UIC 2 Supervised learning vs. unsupervised learning Supervised learning: discover patterns in the data that relate.

Unsupervised Learning. CS583, Bing Liu, UIC 2 Supervised learning vs. unsupervised learning Supervised learning: discover patterns in the data that relate.

Similar presentations

Ads by Google