📈k-Means Clustering
Also known as k-Means, K-Means Algorithm
It splits data into k groups. It moves k centre points until they stop.
Think of it like
Think of it like three ice cream carts on a beach. You place them so no one walks too far.
Example
Emma runs k-means with k set to 4 on her customers' spending. It finds four groups, from rare small spenders to weekly big spenders.
Why it matters
It is one of the simplest and fastest ways to find groups in data that has no labels.
Definition
Common mistake
Key takeaways
- 1You pick k. The number of groups.
- 2Join the nearest. Each point picks a centre.
- 3Move and repeat. Until the centres settle.