k-means Clustering
k-means clustering is a method of vector quantization, originally from signal processing, that aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean (cluster centers or cluster centroid), serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells.
![K=2](/post/2021-05-18-k-means-clustering/ZWxy72b.gif)
![K=3](/post/2021-05-18-k-means-clustering/YM1LT77.gif)
![K=4](/post/2021-05-18-k-means-clustering/2a4rs4L.gif)
![K=5](/post/2021-05-18-k-means-clustering/IY8X6gJ.gif)
GitHub repository: https://github.com/Trimad/k-means-clustering