K Means++ Algorithm | K Means Clustering Algorithm Solved Example Machine Learning by Mahesh Huddar

[@Rizzv1]

Yes the K Means ++ algorithm only address the problem for initial centeroids of K means algo, but both require the value of k before hand

[@pitbullcuba]

Thanks of u, I understood this algorithm

[@3d_chip]

awesome explanation

[@MaheshHuddar]

Thank You Do like share and subscribe

[@sayandey1478]

What do you mean by farthest from these centroids mathematically?

[@parthobarui9792]

Maximum distance

[@sayandey1478]

@parthobarui9792 you have multiple centroid, how do you define farthest, one point nearest to one center can be far from another

[@emmanuelgyekyeatta-penkra454]

@@sayandey1478 1. For every point, 2. calculate its distance to all centroids, 3. select the nearest centroid and its distance and save into a list. 4 Out of the loop 1, choose the point with the maximum distance as the next centroid.

[@Chad-be3jm]

@@emmanuelgyekyeatta-penkra454 is it like sum of the distances from all the centroids, and then whichever point has the largest value is chosen as the next centroid ?

[@pBERA0_0]

@@Chad-be3jm same doubt

[@chaithrad4680]

Hello Sir, can we give cluster size min 4 and max8 using matlab