About this document
K-Means Clustering Example Problem by harshit T is a document available to read on EtoBox.
The document describes using the k-means clustering algorithm to cluster eight points into three clusters over two iterations. In the first iteration, the points are assigned to the closest initial cluster center and the centers are recomputed. In the second iteration, the points are reassigned based on the new centers and final cluster centers are reported.
- Author
- harshit T
- Language
- EN