Start here
K-Means Clustering, in plain language
Unsupervised grouping of data points. K-means is the foundational prototype-based clustering method and a gateway to representation quality, unsupervised evaluation, and scalable vector quantization.
For a small example, six coordinates form two visible groups. Choose initial centers, assign by distance, recompute means, and repeat until assignments stop changing. This is the mechanism to keep in view as the lesson becomes more technical. Before moving on, identify the input, transformation, output, and one observation that would falsify your conclusion.
Key points
- Clusters, centroids, assignments, inertia, and Lloyd iterations.
- Euclidean geometry and spherical-cluster assumptions.
- Initialization, convergence, and local minima.