![](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbsGNlD%2Fbtsa7tEdbXT%2F3yH8bWZCQbMtlkvHF5Bka1%2Fimg.png)
K-Means Clustering Iteratively re-assign points to the nearest cluster center Goal: cluster to minimize variance in data given-clusters Steps 1): Randomly select K centers 2): [Expectation Step] Assign each point to nearest center 3): [Minimize Step] Compute new center (mean) for each cluster 4): Repeat from the [Expectation Step] to the [Minimize Step] until coverage Hyperparater of K-Means Clu..