0% found this document useful (0 votes)
23 views

Chapter 13 Clustering Algorithms

Uploaded by

roopamahesh2003
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views

Chapter 13 Clustering Algorithms

Uploaded by

roopamahesh2003
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 62

Machine

Learnin
g
S. Sridhar and M.
Vijayalakshmi

© Oxford University Press 2021. All rights reserved


Chapter 13

Clustering Algorithms

© Oxford University Press 2021. All rights reserved


Clustering
• CLUSTER ANALYSIS IS UNSUPERVISED LEARNING

• A TECHNIQUE OF PARTITIONING DATA INTO


MEANINGFUL GROUP

• DONE USING TRIAL AND ERROR PROCESS

© Oxford University Press 2021. All rights reserved


Clustering
• CLUSTERING IS GROUPING
PROCESS

© Oxford University Press 2021. All rights reserved


Difference between Clustering and Classification

© Oxford University Press 2021. All rights reserved


Applications of Clustering
Advantages and Disadvantages

© Oxford University Press 2021. All rights reserved


Advantages and Disadvantages

© Oxford University Press 2021. All rights reserved


Properties of Distance Measures

© Oxford University Press 2021. All rights reserved


Euclidean Distance

© Oxford University Press 2021. All rights reserved


Manhattan Distance

© Oxford University Press 2021. All rights reserved


Chebyshev Distance

© Oxford University Press 2021. All rights reserved


Example

© Oxford University Press 2021. All rights reserved


Minkowski Distance
Binary Attributes

© Oxford University Press 2021. All rights reserved


Binary Attributes
Example

© Oxford University Press 2021. All rights reserved


Hamming Distance

© Oxford University Press 2021. All rights reserved


Categorical Variables

© Oxford University Press 2021. All rights reserved


Ordinal Variables

© Oxford University Press 2021. All rights reserved


Cosine Similarity

© Oxford University Press 2021. All rights reserved


Hierarchical Clustering Algorithms

© Oxford University Press 2021. All rights reserved


Example

© Oxford University Press 2021. All rights reserved


Example

© Oxford University Press 2021. All rights reserved


Example

© Oxford University Press 2021. All rights reserved


Visualization

© Oxford University Press 2021. All rights reserved


Complete Linkage Algorithm

© Oxford University Press 2021. All rights reserved


Average Linkage

© Oxford University Press 2021. All rights reserved


Mean-Shift Algorithm

© Oxford University Press 2021. All rights reserved


Mean-Shift Algorithm

© Oxford University Press 2021. All rights reserved


K-means Algorithm

© Oxford University Press 2021. All rights reserved


Advantages and Disadvantages

© Oxford University Press 2021. All rights reserved


Complexity of k-means Algorithm

© Oxford University Press 2021. All rights reserved


Example

© Oxford University Press 2021. All rights reserved


Example

© Oxford University Press 2021. All rights reserved


Example

© Oxford University Press 2021. All rights reserved


Example

© Oxford University Press 2021. All rights reserved


Density-Based Clustering

© Oxford University Press 2021. All rights reserved


Measures

© Oxford University Press 2021. All rights reserved


DBSCAN Algorithm

© Oxford University Press 2021. All rights reserved


Advantages

© Oxford University Press 2021. All rights reserved


Grid-Based Approaches

© Oxford University Press 2021. All rights reserved


Subspace Clustering

© Oxford University Press 2021. All rights reserved


Dense Cells

© Oxford University Press 2021. All rights reserved


CLIQUE

© Oxford University Press 2021. All rights reserved


Advantages

© Oxford University Press 2021. All rights reserved


Fuzzy Clustering

© Oxford University Press 2021. All rights reserved


Shape of Data

© Oxford University Press 2021. All rights reserved


EM Algorithm

© Oxford University Press 2021. All rights reserved


Evaluation of Clustering
1. INTERNA
L
2. EXTERN
AL
3. RELATIV
E

© Oxford University Press 2021. All rights reserved


Evaluation of Clustering

© Oxford University Press 2021. All rights reserved


Evaluation of Clustering

© Oxford University Press 2021. All rights reserved


DUNN Index

© Oxford University Press 2021. All rights reserved


Silhouette Coefficient

© Oxford University Press 2021. All rights reserved


Summary

© Oxford University Press 2021. All rights reserved


Summary

© Oxford University Press 2021. All rights reserved

You might also like