Python Forum
How does K-Means++ work in selecting initial centroids?
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
How does K-Means++ work in selecting initial centroids?
#1
I read some online materials on how K-means++ works in selecting initial centroids in KMeans. But I still don't understand.

Eg, if I specify 3 clusters,

1) K-Means++ will select the 1st centroid point (C1) randomly
2) Compute the Euclidean distance of all points from C1.
3) Make the point with the largest distance C2? Then how is C3 found?

Thank you
Reply
#2
Wikipedia gives a slightly different description of the kmeans++ algorithm with a way to select successive centroids.
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
  K Means Clustering antouanet 0 660 Jan-30-2023, 01:18 PM
Last Post: antouanet
  Pandas - compute means per category and time rama27 7 3,418 Nov-13-2020, 08:55 AM
Last Post: PsyPy
  Selecting first and last row in python sudhirkaukuntla 2 2,438 Oct-01-2019, 06:12 AM
Last Post: sudhirkaukuntla

Forum Jump:

User Panel Messages

Announcements
Announcement #1 8/1/2020
Announcement #2 8/2/2020
Announcement #3 8/6/2020