1. Use the complete link agglomerative clustering with the Euclidean distance to group the data described as follow : x1 x2 x3 x4 x5 0 1 4 7 9 Show, for each epoch, the dissimilarity matrix and the dendrogram. 2. Cut the final dendrogram in order to get two clusters and give the set of objects for each group. 3. Name two algorithms enable to find correctly the groups for the dataset below. Explain briefly your choices. + + + + ++ + #14 # + # + + + + + + + + + + *+ # # + + + ++ ++ + + + + ++ +++ + 2 X ** X X ### + + + + + X X # + twitt F + 7 + + ++ +++ + + + + X X + + + + X # * XXXX +*#+ -146 -8 -6 -4 -2 1. Use the complete link agglomerative clustering with the Euclidean distance to group the data described as follow : x1 x2 x3 x4 x5 0 1 4 7 9 Show, for each epoch, the dissimilarity matrix and the dendrogram. 2. Cut the final dendrogram in order to get two clusters and give the set of objects for each group. 3. Name two algorithms enable to find correctly the groups for the dataset below. Explain briefly your choices. + + + + ++ + #14 # + # + + + + + + + + + + *+ # # + + + ++ ++ + + + + ++ +++ + 2 X ** X X ### + + + + + X X # + twitt F + 7 + + ++ +++ + + + + X X + + + + X # * XXXX +*#+ -146 -8 -6 -4 -2