Data Science, Machine Learning, Programming, Data Analysis, K Means Clustering.
iterative optimization strategy. Each cluster is represented by a centre. A point belongs to a cluster whose centre is closest to it. For simplicity, assume that the centres are randomly initialized. The goal of the model is to find clusters that minimize the sum of SSE over k clusters by shifting