Question: Suppose that the data mining task is to cluster points (two dimensions) into three clusters, where the points are A1(2,10), A2(2,5), A3(8, 4), B1(5, 8),
Suppose that the data mining task is to cluster points (two dimensions) into three clusters, where the points are
A1(2,10), A2(2,5), A3(8, 4), B1(5, 8), B2(7,5), B3(6,6), 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. Use the k-means algorithm to show
1) The three cluster centers after the first round of execution.
2) The final three clusters.
Post the answer as soon as possible
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
