AGLOMERATIVE

CLUSTERING
 QUESTION-1perform agglomerative clustering
using single linkage on following data set .

Distance A B C D E

A 0 5 2 3 1

B 5 0 1 3 2

C 2 1 0 6 2

D 3 3 6 0 3

E 1 2 2 3 0

WITH THIS TABLE ALL DIAGONAL ELEMENT ARE 0 AND WE HAVE TO CHOOSE MIN DISTANCE
AND MAKE CLUSTER OF THAT , WE CHOOSE (B,C) THIS TIME AND FIND DISTANCE WITH
OTHER DATA POINTS.
Pass-1 IN THIS PASS WE AGAIN CHOOSE MINIMUM
DISTANCE AND GROUP ACCORDING THEM AND
FIND DISTANCE .

DISTANCE A (B,C) D E

A 0 2 3 1

(B,C) 2 0 3 2

D 3 3 0 3

E 1 2 3 0

DIST(A,(B,C))=MIN{DIST(A,B),DIST(A,C)}
PASS-2

(A,E) (B,C) D

(A,E) 0 2 3

(B,C) 2 0 3

D 3 3 0

DIST((A,E),
(B,C))=MIN{DIST(A,B),DIST(A,C),DIST(E,B),DIST(E,C)}
PASS-3

((A,E),(B,C) D
((A,E),(B,C) 0 3
D 3 0

DIST(A,(B,C))=MIN{DIST(A,B),DIST(A,C)}
FINAL DENDOGRAM

B C A E D
Complete linkage AGGLOMERATIVE
CLUSTERING
Following five points are given .draw a dendrogram of agglomerative using complete
linkage.

A B C D E

A 0 NOW
CHOOSE
B 9 0 Maximum
VALUE .
C 3 7 0

D 6 5 9 0

E 11 10 2 8 0
PASS-2

A B C,E D

A 0

B 9 0

C,E 11 10 0

D 6 5 9 0
PASS-3

A (B,D) (C,E)

A 0

(B,D) 9 0

(C,E) 11 10 0
PASS-4

(A,(B,D)) (C,E)

(A,(B,D)) 0 11

(C,E) 11 0
DENDROGRAM

11

C E B D A