Question

I got this problem incorrect, and was wondering if you could help

Properties of Kmeans In the following we denote the K-means Algorithm by Kmeans and the Kmeans Problem by Kmeans_prob. Mark all correct statements. Kmeans strictly improves the RMSE on each iteration Kmeans reaches a local minimum of the RMSE after a finite number of iterations The Kmeans_prob is to find a global minimumum of the RMSE Kmeans prob is NP-hard for $k=1$ Kmeans_prob is NP-hard for $k=2$

Answer 1

In the followng we denote the meas Algonithn Prroblem by kman Prob. the Kmeons and kmeans ctatement Cornect Marrk ale Ctrictiy improves iteration C false The RMSE On each Kmeans Locaf minimum of the RMSE numbur of tertationu. [Tte eaches a Kmeans finik after to find minimum Kmeans prtob TTue 3The of the RMSE NP-hand for ke 1t [False 7 4Kmeans prtob 3 NP-hard fon k 2t. CTHue 7. Kmeans Prob