you will implement a simple k-means clustering algorithm. K-means is a popular iterative clustering
data mining
Description
In this assignment, you will implement a simple k-means clustering algorithm. K-means is a popular iterative clustering
algorithm which finds k groups in a given training dataset. Inputs of the algorithm are: 1) k= Number of clusters to be
found, and 2) Number of iterations to be performed. Initially, k-means algorithm starts with random cluster centers
and updates them at each iteration. Figure 1 and 2 show initial and final cluster centers and data points for each cluster
as an example.
Instruction Files
Assignment4.pdf
393.9 KB
