Consider the following 2D dataset:
| Data Point # | x | y |
|---|---|---|
| 1 | 1.90 | 0.97 |
| 2 | 1.76 | 0.84 |
| 3 | 2.32 | 1.63 |
| 4 | 2.31 | 2.09 |
| 5 | 1.14 | 2.11 |
| 6 | 5.02 | 3.02 |
| 7 | 5.74 | 3.84 |
| 8 | 2.25 | 3.47 |
| 9 | 4.71 | 3.60 |
| 10 | 3.17 | 4.96 |
Suppose the initial assignment of cluster centers based on (x, y) coordinates are:
\theta_{A,0}: (1.90, 0.97), \quad \theta_{B,0}: (3.17, 4.96)
Assuming k-means uses Euclidean distance,
d(p, q) = |p - q|_2^2 = \sqrt{\sum_{i=1}^{d} (p_i - q_i)^2}
Simulate the k-means (k=2) algorithm cluster assignment. What are the cluster assignments and distances from the nearer of the initial centers (\theta_{A,0}) and (\theta_{B,0}) after cluster assignment?
| Data # | Cluster Assignment | Distance from the Cluster Centre |
|---|---|---|
| 1 | ||
| 2 | ||
| 3 | ||
| 4 | ||
| 5 | ||
| 6 | ||
| 7 | ||
| 8 | ||
| 9 | ||
| 10 |