Question

using K means algorithm separate {5, 11, 19, 27, 23, 25, 6, 18, 2, 8, 10, 12, 31, 29, 4} into 3 clusters

Answer 1

Answer:

set k = 3 & begin clustering

Cluster 1 = 2,4,5,6,8,10,11,12

Cluster 2 = 18,19

Cluster 3 = 23,25,27,29,31

Explanation:

Carry out the implementation, I believe this is a theoretical question & not practical for such a tinny tiny dataset.

Cluster 1 has a difference of say point distance (d) of 2, except data point 11 & can being to the cluster 1 only

Cluster 2 has d = 1

Cluster 3 has d = 2

if you can plot the graph you'll have your 3 perfect clusters