Suppose that our task is to group points (with (x,y) representing location) into clusters, where the...
Suppose that our task is to group points (with (x,y) representing location) into clusters, where the points are: A(2,5), B(3,3), C(3,4), D(6,4), E(7,5), F(8,4) The distance function is Euclidean distance. An agglomerative hierarchical clustering algorithm is used. Answer the following questions: 1. Show the dendrogram. 2. By visual inspection, at which level the algorithm generates the most natural clustering? What are the clusters at that level?