CS6210:
Document clustering in DLs
10
K-means Algorithm
1.Select k documents randomly as centroids.
2.Assign all documents to their closest centroids.
3.Recompute the centroid of each cluster.
4.Repeat steps 2 & 3 until centroids do
not change.
Computational complexity – O(nkt).