The k-means++ seeding algorithm is one of the most popular algorithms that is used for finding the initial k centers when using the k-means heuristic. The algorithm is a simple sampling procedure and can be described as follows: Pick the first center randomly from the given points. For i > 1, pick a point to be the i th center with probability proportional to the square of the Euclidean distance of this point to the closest previously (i − 1) chosen centers.