Optimizing Early Trajectories in K-Means Clustering: Lookahead Initialization for K-Means
K-Means performance depends heavily on how clusters are initialized. While k-means++ improves over random starts by spreading centroids apart, it’s still greedy and can lock into suboptimal configurations—especially in noisy or high-dimensional data. This post explores a simple tweak: lookahead initialization. For each candidate seed, we simulate a