Assignment 9
Due
: 7/30
Note: Show all your work.
Problem 1 (10 points)
. The k-means algorithm is being run on a small dataset and. After
a certain number of iterations, we have two clusters as shown in the figure. Here, clear
circles are Cluster1 objects and filled circles are Cluster2 objects.
0
1
2
3
4
5
6
7
8
9
8
7
6
5
4
3
2
1
a
b
c
d
e
f
g
Cluster1: {b, e, f}
Cluster2: {a, c, d, g}
Run two more iterations of the k-Means clustering algorithm and show the two clusters at
the end of each iteration. You don’t need to draw figures like above. It is sufficient that
you indicate which objects belong to each cluster at the end of each iteration. Again,
show all your work and use Manhattan distance when calculating distances. Note that this
is not the beginning of the execution of k-means. You are in the middle of the execution
of k-means. So, the first thing you need to do is to compute new centroids of all clusters.

** Subscribe** to view the full document.