Chapter # 10
Clustering by Finding Centers with K-means
Chapter # 10
Clustering by Finding Centers with K-means
Introduction
What is K-means Clustering?
What is K-means Clustering (Cont’d)?
Lloyd’s Algorithm
Lloyd’s Algorithm (Cont’d)
Lloyd’s Algorithm (Cont’d)
MacQueen’s Algorithm
MacQueen’s Algorithm (Cont’d)
MacQueen’s Algorithm (Cont’d)
Hartigan-Wong Algorithm
Hartigan-Wong Algorithm (Cont’d)
Hartigan-Wong Algorithm (Cont’d)
Hartigan-Wong Algorithm (Cont’d)
Choosing K in K-means Clustering
Choosing K in K-means Clustering (Cont’d)
Choosing K in K-means Clustering (Cont’d)
Davies - Bouldin Index
Dunn Index
Pseudo F Statistic
Pseudo F Statistic (Cont’d)
Caveat with Choosing K
Caveat with Choosing K (Cont’d)
Strength and Weakness of K means Clustering
Questions or Queries
