Free Clustering and Segmentation Learning Path
The distance atlas

GOAL
Run a small deterministic k-means example, explain scaling and initialization, and document why clusters need interpretation.

START
Read workbook.html, inspect case-data.csv, complete the five stage outputs, then the capstone. Use evidence-log.csv to record only actions actually performed.

CASE
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.

TOOLS
Basic Python and coordinate geometry. Only synthetic two-dimensional points are used.

LOCAL COMMANDS / OPENING
python cluster.py

ASSESSMENT
Score at least 80/100, supply every required artifact, and satisfy the path-specific critical condition. Rework missing evidence before marking complete.
Critical condition: Initialization, scale and distance are recorded and no cluster interpretation exceeds the synthetic evidence.

SOURCE COURSES
Google Introduction to Clustering: Free Machine Learning Course — https://wikifree.com/courses/google-introduction-to-clustering/

RIGHTS AND SCOPE
Original WikiFree teaching case and exercises. All case data are synthetic. Provider lessons are linked, not redistributed. No certificate, real project delivery or unperformed runtime test is claimed.
