k-means 클러스터링 알고리즘

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..
oneonlee
'k-means 클러스터링 알고리즘' 태그의 글 목록