Dendrogram is simply a tree where: Each node represents a group. Each leaf node is a singleton (i.e., a group containing a single data point). Root node is the group containing the whole data set. Each internal node has two daughter nodes (children), representing the groups that were merged to form it.

Q2. (Total of 20 points) Given the proximity matrix below, do single-linkage and the complete-linkage hierarchical agglomerative clustering dendrograms. (Show your work step by step clearly.) and draw P1 P2 P3 P4 P5 P6 P11 0.70 0.65 0.40 0.20 0.05 P2 P3 P4 P5 P6 1 0.95 0.70 0.50 0.35 1 0.75 0.55 0.40 1 0.80 0.65 1 0.85 Q2. (Total of 20 points) Given the proximity matrix below, do single-linkage and the complete-linkage hierarchical agglomerative clustering dendrograms. (Show your work step by step clearly.) and draw P1 P2 P3 P4 P5 P6 P11 0.70 0.65 0.40 0.20 0.05 P2 P3 P4 P5 P6 1 0.95 0.70 0.50 0.35 1 0.75 0.55 0.40 1 0.80 0.65 1 0.85