Hierarchical clustering

Organize data in a hierarchical fashion (dendrogram)

Clustering obtained by cutting the dendrogram at a desired

level: each connected component forms a cluster.

How to do it?

34
Bottom up hierarchical clustering
Assign each data point to its own cluster, 9" 6 (" , 9# 6
(# , … , 9+ 6 (+ , and let K 6 .9" , 9# , … , 9+ 0
O 95 , 9; 6 min 06(, 17
T∈U) ,V∈UW
Do
Find two clusters to merge: 1, ? 6 789'1:"L5,;L|N| O695 , 9; 7

Merge the two clusters to a new cluster: 9 ← 95 ∪ 9; keep track of

relations
Remove the merged clusters: K ← K ∖ 95 , K ← K ∖ 9; 9

Add the new cluster: K ← K ∪ .90 95 9;

While K S 1
35
Hierarchical clustering: step-2

9"#

1 2 3.1 4 4.9 5.9 6.9 8 9 10 11

K 6 . 9" 9# 9$ 9X 9Y … 9"" 0

K 6 . 9" 9# 9"# 9Y … 9"" 0

36
Hierarchical clustering: step-3

9"$
9"#

1 2 3.1 4 4.9 5.9 6.9 8 9 10 11

K 6 . 9" 9# 9$ 9X 9Y … 9"" 0

K 6 . 9" 9# 9"# 9Y … 9"" 0

K 6 . 9" 9# 9"$ … 9"" 0

37