---
id: K-means++
aliases: []
tags: []
---

- The first centroid is selected at random
- The next centroid selected is the one that is the farthest from the currently
  selected (selection is based on a weighted probability score)
- The selection continues until _K_ centroids are obtained
- [Youtube](https://www.youtube.com/watch?v=z2yncM2HE6M)