- Manually Implement K Mean The Dataset Contains 10 2 D Points 5 9 3 0 4 6 3 0 6 2 2 8 4 7 3 2 5 5 4 2 1 (54.46 KiB) Viewed 102 times
Manually implement K-Mean The dataset contains 10 2-d points (5.9, 3.0), (4.6, 3.0), (6.2, 2.8), (4.7, 3.2), (5.5, 4.2),
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Manually implement K-Mean The dataset contains 10 2-d points (5.9, 3.0), (4.6, 3.0), (6.2, 2.8), (4.7, 3.2), (5.5, 4.2),
Manually implement K-Mean The dataset contains 10 2-d points (5.9, 3.0), (4.6, 3.0), (6.2, 2.8), (4.7, 3.2), (5.5, 4.2), (5.0, 3.0), (4.9, 3.1), (6.7, 3.0), (5.2, 3.8), (6.0, 3.0) Assume K=3, the initial means are Red: (6.2, 3.2) Green: (6.6, 3.7) Blue: (6.5, 3.0) 1a. What is the center of the first cluster (red) after one iteration? 1b. What is the center of the second cluster(green) after two iteration? 1c. What is the center of the third cluster (blue) when the clustering converge?