(26)
(Choose 1 answer)
Which of the following statements best describes the iterative part of the K-means algorithm?
A. The k-means algorithm assigns a number of clusters at random.
B. The k-means algorithm adjusts the centroids to the new mean of each cluster, and then it this process until no example is assigned to another cluster.
C. The k-means algorithm iteratively deletes outliers.
D. The k-means algorithm iteratively calculates the distance from each point to the centroid
