Question: Question Q3: (30 marks) algorithm and Euclidean distance to cluster the following 8 data centers are A3 (for cluster 1 ), A4 (for cluster 2

 Question Q3: (30 marks) algorithm and Euclidean distance to cluster the

Question Q3: (30 marks) algorithm and Euclidean distance to cluster the following 8 data centers are A3 (for cluster 1 ), A4 (for cluster 2 ), and A7 (for cluster 3). please show: (i) ( 5 marks) The members of the new clusters. (ii) ( 5 marks) The centers 10-y plane with all the 8 points on it and show the (iii) ( 5 marks) Draw a 1010xy centers after the first iteration. (b) (15 Marks) Continue from (a), run the k-means algorithm until convergence. (i) ( 5 marks) How many more iterations are needed to converge? (ii) (5 marks) Describe the detailed calculation procedure. (iii) ( 5 marks) Draw the 1010xy plane with all the 8 points on it and show the clusters and the cluster centers after the final iteration

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!