Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Use the k-means algorithm and Euclidean distance to cluster the following eight examples into three clusters: A1 = (26, 18), A2 = (20, 26), A3(14,

Use the k-means algorithm and Euclidean distance to cluster the following eight examples into three clusters:

A1 = (26, 18), A2 = (20, 26), A3(14, 20), A4(24, 20), A5(14, 30), A6(22, 18), A7(8, 18), A8(12, 14)

a. Suppose that the initial seeds (centres of each cluster) are A2, A3, and A8. Run the k-means algorithm for one epoch only. At the end of this epoch,
o show the new clusters (i.e., the examples belonging to each cluster);

o show the centres of the new clusters;

o draw a graph space with all eight points, and show the clusters after the first epoch and the new centroids.

b. Complete the process for other iterations. How many more iterations are needed for the algorithm to converge? Draw the final result of the remaining epochs.

Step by Step Solution

3.32 Rating (152 Votes )

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Discrete Mathematics and Its Applications

Authors: Kenneth H. Rosen

7th edition

0073383090, 978-0073383095

More Books

Students also viewed these Mathematics questions

Question

Task 2 : Generating a Certificate Request for Your Web Server

Answered: 1 week ago