Question: We have the following two-dimensional data points: a (3,2), b (3,3), c (4,3), d (5,3), e (1,2), f (2,4), g (1,1), h (2,1). Identify clusters
We have the following two-dimensional data points: a (3,2), b (3,3), c (4,3), d (5,3), e (1,2), f (2,4), g (1,1), h (2,1). Identify clusters by applying the k-means algorithm, with k=2. Show that the ratio of the between-cluster variation to the within-cluster variation increases with each pass of the algorithm. Please show your work and how the algorithm works: steps, formulas, calculations, tables, plots, and final clusters
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
