Task: Question Answering
Input (English): The K-means algorithm:
(A)Requires the dimension of the feature space to be no bigger than the number of samples (B)Has the smallest value of the objective function when K = 1 (C)Minimizes the within class variance for a given number of clusters (D)Converges to the global optimum if and only if the initial means are chosen as some of the samples themselves
Output (English): C