Question: Suppose that the data mining task is to cluster the following eight points (with (x, y) representing location) into three clusters. A1 (2, 10),

Suppose that the data mining task is to cluster the following eight points (with (x, y) representing location) into three clusters. 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. Use the k-means algorithm to show only (a) The three cluster centers after the first round of execution and (b) The final three clusters
Step by Step Solution
3.43 Rating (150 Votes )
There are 3 Steps involved in it
Answer Solution KMeans working procedure it takes n no of predefined c... View full answer
Get step-by-step solutions from verified subject matter experts
