A1(2, 10), A2(2, 5), A3(8, 4), B1(5, 8), B2(7, 5), B3(6, 4), C1(1, 2), C2(4, 9). The distance function is Euclidean distance. Suppose initially we assign A1, B1, and C1 as the center of each cluster, respectively. Run manually the k-means algorithm to find the clusters obtained during the first three iterations of the algorithm. Show work and the results done in obtaining them.
Show the clusters obtained during the first three iterations of the algorithm. Your answer is required to use the following format for each iteration and cluster:
Iteration x
Cluster 1
CENTER:
POINTS:
-----------------------------------------------
Cluster 2
CENTER:
POINTS:
-----------------------------------------------
Cluster 3
CENTER:
POINTS: