INTRODUCTION TO DATA MINING
Question 3: K-means clustering
Use the k-means algorithm and Euclidean distance to cluster
the following seven examples into two clusters:
A1=(1, 1), A2=(1.5, 2), A3=(3,4), A4=(5,7), A5=(3.5,5),
A6=(4.5,5), A7=(3.5,4.5)
Suppose that the initial seeds (centers of each cluster) are
A1 and A4. Run the k-means algorithm for 2 epochs. At
the end of this epoch show:
a) Distance matrix by calculating Euclidean distance.
b) The new clusters (i.e. the examples belonging to each
cluster)
c) The...