Question 10
Answer the given subquestions.
Consider the following hard K-means clustering problem with four points: P (1, 1), Q (2, 1), R (4, 3), and S (5, 4). Consider the number of clusters to be k = 2 and the initial centroids to be C1 = (0, 0) and C2 = (4, 4). After how many iterations will the algorithm terminate and what will be the final centroids?
2, (1, 1), (4, 4)
3, (1, 1), (4, 4)
4, (1.5, 1), (4.5, 3.5)
2, (1.5, 1), (4.5, 3.5)