Given an input Euclidean distance matrix of size 6 by 6, as shown in Table 1.

 

1. Perform single linkage-hierarchical clustering (agglomerative) and draw the dendrogram.
2. Perform complete linkage-hierarchical clustering (agglomerative) and draw the dendrogram. 
3. How to determine the optimal number of clusters from the dendrogram? Show in your dendrograms. 
4. If you are using K-mean clustering, how to determine the optimal number of clusters? 

Transcribed Image Text:

1 2 3 4 5 6 2 0.12 0 0.51 0.25 0 4 0.84 0.16 0.14 5 0.28 0.77 0.70 0.45 0 0.34 0.61 0.93 0.20 0.67 0 Table 1: Euclidean Distance Matrix 1. 3. 6. 1 2 3 4 5 6 2 0.12 0 0.51 0.25 0 4 0.84 0.16 0.14 5 0.28 0.77 0.70 0.45 0 0.34 0.61 0.93 0.20 0.67 0 Table 1: Euclidean Distance Matrix 1. 3. 6.

Answer rating: 100% (QA)

ANSWER 1 Hierarchical clustering with singlelinkage See the diagram in the Explanation Box 2 Hierarchical clustering with complete linkage See the dia... View the full answer