Agglomerative Algorithm
Example Three (Self Practice)
Problem: Assume that the database D is given by the table below. Follow single link technique to find clusters in D. Use Euclidean distance measure.
Step 1. Plot the objects in n-points x-dimensional space (where n is the number of attributes). In our case, we have 2 attributes - x and y, so we plot the objects p1, p2, ... p6 in 2-dimensional space:
.- 0.6
p5 0.08
0.5
5
p6 0.45
0.4
2
0.3
y
0.53
0.38
0.32
0.19
0.41
0.30
0.2
0.1
0
0.1 0.2 0.3 0.4 0.5 0.6x