Professional Documents
Culture Documents
Clustering
Ke Chen
• Agglomerative Algorithm
• Summary
a
ab
b Cluster distance
abcde
c Termination condition
cde
d
de
e
Divisive
Step 4 Step 3 Step 2 Step 1 Step 0
1. Calculate the distance matrix . 2. Calculate three cluster distances between C 1 and C2.
Single link
a b c d e dist(C1 , C 2 ) min{d(a, c), d(a, d), d(a, e), d(b, c), d(b, d), d(b, e)}
a 0 1 3 4 5 min{3, 4, 5, 2, 3, 4} 2
b 1 0 2 3 4 Complete link
dist(C1 , C 2 ) max{d(a, c), d(a, d), d(a, e), d(b, c), d(b, d), d(b, e)}
c 3 2 0 1 2
max{3, 4, 5, 2, 3, 4} 5
d 4 3 1 0 1
Average d(a, c) d(a, d) d(a, e) d(b, c) d(b, d) d(b, e)
e 5 4 2 1 0 dist(C1 , C 2 )
6
3 4 5 2 3 4 21
3.5
6 6
COMP24111 Machine Learning 6
Agglomerative Algorithm
• The Agglomerative algorithm is carried out in three steps:
data matrix
Euclidean distance
distance matrix
COMP24111 Machine Learning 8
Example
• Merge two closest clusters (iteration 1)