Clustering
Frame the two-cluster customer segmenter experiment
Page 1 advances one concrete two-cluster customer segmenter: explain the decision, run the code, inspect failure, measure evidence, and keep only what is ready to ship.
1Try it yourself
Playground
Cluster playground
Cluster the points, then assign meaning. Don’t mistake a grouping for ground truth.
Before you start
Why this matters
Without running code, predict the output of this page's example and name the intermediate value that would prove your prediction. Then write one sentence answering: “What could look successful while actually being wrong?” For this stage, focus on unstable or misleading clusters. Keep the prediction nearby; comparing it with the real output is the first debugging exercise, not a quiz about syntax.
2Learn the idea
Read
Build focus
A lab needs a falsifiable claim before code. The claim here is that group six unlabeled customers by annual visits and average basket value without pretending the groups are permanent identities. Record the tiny dataset, expected behavior, and one reason the result could be misleading. The first artifact is an experiment brief, not a model screenshot. It names the user, the decision the output supports, and the baseline you must beat. For this chapter, the baseline is deliberately transparent so later complexity has something honest to compare against.
The artifact's user-facing goal is specific: group six unlabeled customers by annual visits and average basket value without pretending the groups are permanent identities. Its accepted input is rows shaped as (visits, basket_value), normalized before Euclidean distance. Those statements are intentionally narrower than “build an AI system.” Narrow scope lets us inspect every input and expected result, and it prevents a toy result from being presented as a production claim. Run the inventory below before implementing anything. Its output proves that the fixture is present and small enough to inspect by hand.
Read
Run the example
Save this as lesson.py and run python3 lesson.py. It uses only the language standard library, so the example is reproducible offline.
points=[(2,18),(3,20),(4,22),(12,75),(13,78),(15,82)]
print(len(points), min(x for x,_ in points), max(y for _,y in points))
Expected output: 6 2 82. Exact floating-point formatting may vary slightly, but the asserted behavior must not. Read the output as evidence about this stage, not merely proof that the interpreter started.
Read
Debug the stage
Print the scaled coordinates, distance from every point to every center, assignment vector, and recomputed centers. If only the numeric cluster IDs swap, the partition did not change; compare pairs of points rather than label 0 versus label 1. If one center receives no points, preserve or reseed it explicitly instead of dividing by zero. Re-run with several starting centers and inspect whether the same customers remain together.
At the experiment brief stage, save the smallest failing fixture beside the expected result. Change one cause at a time and rerun the exact command printed above; that makes the repair reviewable and keeps this chapter's progressive artifact reproducible.
Read
Evaluate before continuing
Report WCSS beside a one-cluster baseline, then compare partitions across seeds. A lower WCSS always follows from adding clusters, so it cannot select k by itself. Review whether each segment has enough members and whether a plain-language description is supported by visits and basket value. Never name a segment with a personality or sensitive identity that the features do not measure.
For this experiment brief page, preserve the fixture and result as evidence for the next page. Label observations separately from conclusions: a passing assertion establishes the behavior it names, while broader usefulness requires the chapter's full evaluation set and stated operating limits.
Continue learning · glossary & guides
- [ ] What exact claim can this tiny fixture disprove?
- [ ] Which baseline prevents a decorative success claim?
- [ ] What result would make me stop before implementation?
- [ ] Can I distinguish a stable partition from swapped cluster numbers?