classification and clustering

21
Clustering and Classification Presented by: Yogendra, Govinda, Lov, Sunena

Upload: yogendra-tamang

Post on 14-May-2015

201 views

Category:

Education


2 download

DESCRIPTION

Regular Presentation on Classification and Clustering.

TRANSCRIPT

Page 1: Classification and Clustering

Clustering and Classification

Presented by:

Yogendra, Govinda, Lov, Sunena

Page 2: Classification and Clustering

Outline

• Background

• Classification

• Clustering

• Examples

• References

Page 3: Classification and Clustering

Background

• Clustering is “the process of organizing objects into groups whose members are similar in some way”.

• A cluster is therefore a collection of objects which are “similar” between them and are “dissimilar” to the objects belonging to other clusters.

Page 4: Classification and Clustering

Clustering

Page 5: Classification and Clustering

Clustering

• Organizing objects into group.

Cluster analysis Components

• Similarity(Distance) Measure

• Clustering Algorithm

Page 6: Classification and Clustering

Similarity Measure

• Distance between two data points

Page 7: Classification and Clustering

Clustering Algorithms• Exclusive Clustering• Data belongs to only one definite cluster

• Eg. K-Means Algorithms

• Overlapping Clustering• Uses fuzzy set for clustering

• Single Data may belong to one or more clusters

• Hierarchical Clustering• Agglomerative(Bottom-up)

• Divisive(Top-Down)

Page 8: Classification and Clustering

Clustering Algorithms

Agglomerative

Divisive

Page 9: Classification and Clustering

K-Means Algorithm

Page 10: Classification and Clustering

K-Means Algorithm

Minimization of Squared Error Function

Page 11: Classification and Clustering

Demo

Page 12: Classification and Clustering

Here we have a dataset!

Page 13: Classification and Clustering

We randomly choose 2 group centroids!

Page 14: Classification and Clustering

We assign each point to the group that has the closest centroit.

Page 15: Classification and Clustering

We recalculate the positions of the centroids.

Page 16: Classification and Clustering

We assign each point to the group that has the closest centroid.

Page 17: Classification and Clustering

We recalculate the positions of the centroids.

Page 18: Classification and Clustering

Other Approaches

Page 19: Classification and Clustering

Hierarchical clustering

• Agglomerative (bottom up)

1. start with 1 point (singleton)

2. recursively add two or more appropriate clusters

3. Stop when k number of clusters is achieved.

Page 20: Classification and Clustering

Hierarchical clustering

• Divisive (Top down)

1. Start with a big cluster

2. Recursively divide into smaller clusters

3. Stop when k number of clusters is achieved.

Page 21: Classification and Clustering

References

• www-users.cs.umn.edu/~kumar/.../chap8_basic_cluster_analysis.pdf

• http://en.wikipedia.org/wiki/Cluster_analysis

• https://www.cs.duke.edu/courses/fall03/cps260/notes/lecture18.pdf

• http://www.matlab-cookbook.com/recipes/0100_Statistics/150_kmeans_clustering.html

• http://www.cs.utah.edu/~germain/PPS/Topics/Matlab/plot.html

• http://www.mathworks.com/help/stats/k-means-clustering.html