This is a reference to the image for the node 'Image of K-means Clustering Process'

Page, Justin T, et al. “BamBam: Genome Sequence Analysis Tools for Biologists.” BMC Research Notes, vol. 7, no. 1, Nov. 2014, p. 829.,doi:10.1186/1756-0500-7-829.

[www.researchgate.net/figure/K-means-clustering-algorithm-An-example-2-cluster-run-is-shown-with-the-clusters_fig3_268880805](https://www.researchgate.net/figure/K-means-clustering-algorithm-An-example-2-cluster-run-is-shown-with-the-clusters_fig3_268880805) 

University of Michigan - Ann Arbor

This picture depicts an example of the K-Means Clustering process. Random data points are selected and serve as the initial clusters. How many there are depends on the value of k, which in this picture’s case, k = 2. It then measures the Euclidean distance between the 1st data point and the two initial clusters, and assigns it to whichever cluster is the closest. It repeats this process, calculates the mean values, and reclusters based on that. The process repeats until the cluster no longer changes (seen in final image).


Learn Before

Related