Question: Perform the agglomerative hierarchical clustering algorithm on the following 5 data points using complete linkage and Euclidean distance measure: (5, 4.5), (4.5, 5), (3,4), (4,
Perform the agglomerative hierarchical clustering algorithm on the following 5 data points using complete linkage and Euclidean distance measure: (5, 4.5), (4.5, 5), (3,4), (4, 4) and (3, 3.5). How would you obtain 3 clusters? Show your results using a dendrogram.
Also briefly explain the mixture of Gaussians model and explain how it can be used for clustering.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
