Clustering
Measure whether the two-cluster customer segmenter works
Page 4 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.
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.
1Learn the idea
Read
Build focus
A plausible result is not yet evidence. Evaluate with within-cluster sum of squared distances (WCSS), assignment stability across seeds, and a domain-readable cluster summary. The test fixture should contain an easy positive case, an easy negative or baseline case, and the boundary case most likely to flip. Separate assertions about software contracts from claims about model quality: both matter, but they answer different questions.
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. The runnable check below turns one success criterion into an assertion, so a regression exits loudly.
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.
from math import dist
groups=[[(0,0),(.1,.1),(.2,.1)],[(.8,.9),(.9,.9),(1,1)]]
centers=[tuple(sum(v)/len(g) for v in zip(*g)) for g in groups]
wcss=sum(dist(p,c)**2 for g,c in zip(groups,centers) for p in g)
print(round(wcss,3)); assert wcss < .1
Expected output: a small WCSS value and no assertion failure. 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 evaluation 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 evaluation 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
- [ ] Does the fixed set include positive, negative, and boundary cases?
- [ ] Are contract tests separated from quality metrics?
- [ ] Did I compare against a simple baseline?
- [ ] Can I distinguish a stable partition from swapped cluster numbers?