The question in data mining and machine learning

1) Use the dissimilarity matrix in the table below to perform single link hierarchical clustering. Show step by step the modifications in the dissimilarity matrix. (4 pts) P4 P5 1 P2 P3 P4 P5 P1 P2 P3 0.00 0.90 0.00 0.590.36 0.00 0.450.53 0.56 0.65 0.02 0.15 0.00 0.24 0.00 2) Show your results by drawing a dendrogram. The dendrogram should clearly show the order in which the points are merged. (1 pt) 3) How many sets of cluster can you deduced from the dendrogram ? (1 pt) 4) Given a dendrogram, how would you proceed to provide a set of clusters to a user. (1 pt) 5) Illustrate the strength and weakness the two hierarchical method principles : single link and complete link. (1 pt) 6) Could you apply k-means on this dissimilarity matrix to build cluster ? Explain your answer. (2 pts) 1) Use the dissimilarity matrix in the table below to perform single link hierarchical clustering. Show step by step the modifications in the dissimilarity matrix. (4 pts) P4 P5 1 P2 P3 P4 P5 P1 P2 P3 0.00 0.90 0.00 0.590.36 0.00 0.450.53 0.56 0.65 0.02 0.15 0.00 0.24 0.00 2) Show your results by drawing a dendrogram. The dendrogram should clearly show the order in which the points are merged. (1 pt) 3) How many sets of cluster can you deduced from the dendrogram ? (1 pt) 4) Given a dendrogram, how would you proceed to provide a set of clusters to a user. (1 pt) 5) Illustrate the strength and weakness the two hierarchical method principles : single link and complete link. (1 pt) 6) Could you apply k-means on this dissimilarity matrix to build cluster ? Explain your answer. (2 pts)