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-means clustering minimizes within-cl
![k-means clustering - Wikipedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/1c654a58bb741aab520f6495ea459aea8836fa18/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2Fthumb%2F0%2F02%2FNeural_network_with_dark_background.png%2F1200px-Neural_network_with_dark_background.png)