Replies: 1 comment
-
I found what I missed in the first place: closest_dist_sq is updated in each iteration so that the minimum distances to all the centers does not have to be computed again in each iteration:
(The |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
I'm confused by the implementation of k-means++.
The original paper says:
In the sklearn implementation, however, the already selected centers are never used inside the loop to select the next point. To me, it seems that the next selected center rather depends only on X.
What am I overlooking?
The documentation says:
Unfortunately, this link is broken.
Beta Was this translation helpful? Give feedback.
All reactions