Consider the following set of one-dimensional points: 0.090, 0.172, 0.310, 0.335, 0.429, 0.640, 0.642, 0.851}. All the points are located in the range between [0,1] (a) Suppose we apply kmeans clustering to obtain three clusters, A, B, and C. If the initial centroids of the three clusters are located at 0.15, 0.25, 0.90), respectively, show the cluster assignments and locations of the centroids after the first two iterations by filling out the following table. Did the algorithm converges (i.e., did the centroid locations change) after two iterations? Cluster assignment of data points (enter A, B, or C) |0.172 Centroid Locations |-0.09() 0.310 :3:35 | 0.429 . O.640-l 0.642 |0.851 lter 0 0.15 0.250.90 2 (b) Repeat part (a) using [0.10, 0.45, 0.90j as the initial centroids. Show the cluster assignments and locations of the centroids after the first two iterations by filling out the following table. Did the algorithm converges after two iterations'? Cluster assignment of data points (enter A, B, or C) Centroid Locations 5 0.429 0,6400,64 Iter 0 .090 0.172 0.310 0.10 0.450.90 2 (c) Compute the sum-of-squared errors (SSE) for the clustering solution in part (a). (d) Compute the sum-of-squared errors (SSE) for the clustering solution in part (b). Which solution is better in terms of their SSE? Consider the following set of one-dimensional points: 0.090, 0.172, 0.310, 0.335, 0.429, 0.640, 0.642, 0.851}. All the points are located in the range between [0,1] (a) Suppose we apply kmeans clustering to obtain three clusters, A, B, and C. If the initial centroids of the three clusters are located at 0.15, 0.25, 0.90), respectively, show the cluster assignments and locations of the centroids after the first two iterations by filling out the following table. Did the algorithm converges (i.e., did the centroid locations change) after two iterations? Cluster assignment of data points (enter A, B, or C) |0.172 Centroid Locations |-0.09() 0.310 :3:35 | 0.429 . O.640-l 0.642 |0.851 lter 0 0.15 0.250.90 2 (b) Repeat part (a) using [0.10, 0.45, 0.90j as the initial centroids. Show the cluster assignments and locations of the centroids after the first two iterations by filling out the following table. Did the algorithm converges after two iterations'? Cluster assignment of data points (enter A, B, or C) Centroid Locations 5 0.429 0,6400,64 Iter 0 .090 0.172 0.310 0.10 0.450.90 2 (c) Compute the sum-of-squared errors (SSE) for the clustering solution in part (a). (d) Compute the sum-of-squared errors (SSE) for the clustering solution in part (b). Which solution is better in terms of their SSE
