In kmeans- the algorithm has multiple iterations. If we have a simple 2d problem, and a k =2, it begins by assigning the first centroids to [ Select ] ["the euclidean optimized node", "a random initial starting point", "the furthest edge of the state space"] , and then [ Select ] ["measuring the distance", "iteratively removing the worst fit", "removing the center", "reducing the distance"] of each point or record to the centroid.