Which of the following statements about the k-means clustering algorithm is false?
A) Each cluster of samples is grouped around a centroid-the cluster's center point.
B) Initially, the algorithm chooses k centroids at random from the dataset's samples. Then the remaining samples are placed in the cluster whose centroid is the closest.
C) The centroids are iteratively recalculated and the samples re-assigned to clusters until, for all clusters, the distances from a given centroid to the samples in its cluster are maximized.
D) The algorithm's results are a one-dimensional array of labels indicating the cluster to which each sample belongs, and a two-dimensional array of centroids representing the center of each cluster.

Question

Quizplus · Accepted Answer

The false statement is C because, in the k-means clustering algorithm, the centroids are recalculated and samples reassigned until the distances from a given centroid to the samples in its cluster are minimized, not maximized.

Which of the Following Statements About the K-Means Clustering Algorithm