Cluster with k-means algorithm

in /by

Cluster with k-means algorithm

Chapter 8, page 162, problems 6 and 7 (http://secs.ac.in/wp-content/CSE_PORTAL/DataMining…)

1) Suppose that we have the following data:
a b c d e f g h i j
(2,0) (1,2) (2,2) (3,2) (2,3) (3,3) (2,4) (3,4) (4,4) (3,5)

Identify the cluster by applying the k-means algorithm, with k = 2. Try using initial cluster centers as far apart as possible.

2) Refer to Exercise 6. Show that the ratio of the between-cluster variation to the within-cluster variation decreases with each pass of the algorithm.

"You need a similar assignment done from scratch? Our qualified writers will help you with a guaranteed AI-free & plagiarism-free A+ quality paper, Confidentiality, Timely delivery & Livechat/phone Support.


Discount Code: CIPD30



Click ORDER NOW..

order custom paper