You measured the following data points:
(a) [5 marks] Using the Euclidean distance in and the starting representatives , you are asked to consider the K-means clustering with . How many iterations will be required for the 2-means algorithm to converge and what is the final clustering assignment?
(b) [5 marks] Show that the 2-means algorithm would return a different clustering assignment for other choices of the starting representatives.
(c) [8 marks] Using two clustering assignments obtained at point (a) and (b) from different starting representatives, compute the silhouette index for the point . Comment on how well the two assignments are clustering this point.
(d) [7 marks] Define a Gaussian mixture model to cluster the inputs above in clusters. Describe one advantage of this approach over the K-means (for a generic sample, not necessarily the one considered in this question).