Run a small deterministic k-means example, explain scaling and initialization, and document why clusters need interpretation.
Six fictional service locations have two already standardized teaching coordinates. Start k-means with centers at A=(0,0) and D=(8,8). Use squared Euclidean distance, assign ties to cluster 1 and stop when assignments no longer change. Coordinates are abstract, not demographic attributes.
| Point | x | y |
|---|---|---|
| A | 0 | 0 |
| B | 0 | 2 |
| C | 2 | 0 |
| D | 8 | 8 |
| E | 8 | 10 |
| F | 10 | 8 |
Distance reflects the chosen features and their scale. A large numerical range can dominate another feature even when it is not more relevant. Define what the coordinates represent and what was standardized. This synthetic case isolates the mechanics; real segmentation requires a defensible representation and attention to possible harms.
Write the feature and scaling contract and plot the six points.
Representation note
Record your result and evidence here or in a separate file.
The note does not infer real customer traits from abstract coordinates.
Label interpretation separately from numerical input.
Assign each point to the nearest current center using the declared distance. Then recompute each center as the mean of its assigned points. Keep assignment and update as separate steps so the process is inspectable. Empty clusters require an explicit handling policy; this starting case does not produce one.
Calculate the first assignments and updated centers by hand.
Iteration table
Record your result and evidence here or in a separate file.
A/B/C join cluster 1 and D/E/F cluster 2; centers become (2/3,2/3) and (26/3,26/3).
Square differences before summing and do not round centers prematurely.
Fix initial centers and the tie rule for a deterministic exercise. Include a maximum iteration count to prevent accidental endless loops. Record the final assignments, centers and within-cluster sum of squares. A successful run on six points demonstrates the implementation, not the suitability of k-means for every dataset.
Run the supplied pure-Python reference and inspect its stopping rule.
Clustering run record
Record your result and evidence here or in a separate file.
The final within-cluster sum of squares is 32/3, about 10.667.
Recompute distances to the final centers rather than the initial ones.
A clustering result depends on k, initialization, scaling and geometry. Compact numerical groups do not necessarily answer the business question. Compare a one-cluster baseline and consider an outlier. State the limitations instead of using a visually neat split as proof that two natural categories exist.
Compare k=1 with k=2 and describe what an outlier could change.
Model-choice note
Record your result and evidence here or in a separate file.
The note treats two clusters as a chosen model, not ground truth.
Add a task-based reason for using the grouping.
A handoff should preserve the feature definitions, algorithm choices and uncertainty about interpretation. Avoid assigning people consequential labels from a toy cluster result. Name groups neutrally until supported evidence justifies a more meaningful description. Keep the raw points and the run settings available for reproduction.
Write a short segmentation report using neutral cluster names.
Reproducible report
Record your result and evidence here or in a separate file.
Every group statement can be traced to supplied coordinates.
Remove labels that imply unmeasured behavior or value.
Deliver the scatterplot, manual iteration, Python run, k comparison and interpretation note. Add a seventh point and document how the changed input affects the result.
Initialization, scale and distance are recorded and no cluster interpretation exceeds the synthetic evidence.
| Criterion | Points | Evidence |
|---|---|---|
| Evidence and correctness | 30 | Calculations, source use and results match the supplied case; limitations are honest. |
| Required artifacts | 30 | All five stage outputs and the capstone handoff are present and inspectable. |
| Reasoning and decisions | 20 | Choices, assumptions, alternatives and the case-specific critical condition are explained. |
| Reproducibility | 10 | A reviewer can follow the stated steps and distinguish expected from observed results. |
| Clear communication | 10 | Labels, units, structure and evidence references make the work easy to review. |
Score at least 80/100, supply every required artifact, and satisfy the path-specific critical condition. Rework missing evidence before marking complete.
The first cluster center is (2/3,2/3); its squared-distance total is 16/3. The second is a translation of the same shape and also contributes 16/3, so total SSE is 32/3. A one-cluster center at (14/3,14/3) gives SSE 608/3.
This is a tiny deterministic demonstration, not validated customer segmentation or a production ML service.