What is k-means clustering?
A representative clustering method that divides data into a predetermined number k of clusters. It places k tentative centers, then repeats assigning each data point to the cluster of the nearest center and moving each center to the mean of its cluster's data until the assignments stop changing. It is simple to compute and works on large data, but the result depends on the initial centers, k must be chosen by the user, and clusters that are not roughly spherical are hard to separate.
Japanese name: k平均法
k-means clustering appears in 1 practice question across 1 topic, including Machine Learning Basics.
Field: Machine Learning Basics