K-Means++ Centroid Initialization

Поділитися
Вставка
  • Опубліковано 13 вер 2024

КОМЕНТАРІ • 8

  • @TheJTsupport
    @TheJTsupport 6 місяців тому +1

    super video. Perfect for understanding the algorithm

  • @maitanaka7168
    @maitanaka7168 3 місяці тому

    Thank you for the video to clarify the algorithm of kmeans++

  • @goldenpiece7087
    @goldenpiece7087 10 місяців тому

    that's was awesome, underrated animation.

  • @tiongah7690
    @tiongah7690 8 місяців тому +2

    amazing animation! 0:32 why pick point 34 instead of 43? point 43 would be the farthest

    • @RITWIKGHOSH-oc5ud
      @RITWIKGHOSH-oc5ud 7 місяців тому +4

      because probability is associated with each point. Larger the distance, higher the chance of it gets chosen. But that doesn't gurantee it will be chosen.

    • @AoibheDraws
      @AoibheDraws Місяць тому

      @@RITWIKGHOSH-oc5ud could you explain how it gets chosen? It looks like it’s sorted by probability but then backs off from the most probable. What is the other factor we’re looking for?

    • @ritwikghosh5833
      @ritwikghosh5833 Місяць тому

      ​@@AoibheDraws I already explained this above.
      Let's say the probability of 3 points being chosen is 35%, 50% and 15%.
      In this case any of the 3 points can be chosen. But the chance of Point 2 being chosen is most. It doesn't guarantee.

  • @catpotato9782
    @catpotato9782 11 місяців тому +1

    +1 student saved