K-means clustering

From Machinelearning
Revision as of 17:14, 31 March 2020 by Sebastian (talk | contribs)

The K-Means clustering algorithm, a commonly used clustering algorithm, is an iterative process used to minimize the distance of the data point from the average data point in the cluster.[1] The k-means algorithm is one of the fastest clustering algorithms available.[2]

References

  1. ↑ 7 Innovative Uses of Clustering Algorithms in the Real Worlddatafloq.com
  2. ↑ KMeansscikit-learn.org
Retrieved from "https://machinelearning.subwiki.org/w/index.php?title=K-means_clustering&oldid=3012"