Which clustering algorithm iteratively assigns points to the nearest cluster center and then updates the center based on the mean of assigned points?
Show answer
K-means
K-means is a centroid-based clustering algorithm that minimizes the within-cluster sum of squares (inertia). It is sensitive to the initial placement of centroids, a problem often addressed by the k-means++ initialization strategy.
Also asked as:
- What centroid-based clustering algorithm updates cluster centers by calculating the mean of all points assigned to them?