K-means clustering: Difference between revisions
(Created page with "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...") |
No edit summary |
||
| Line 1: | Line 1: | ||
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.<cite>[https://datafloq.com/read/7-innovative-uses-of-clustering-algorithms/6224]</cite> The k-means algorithm is one of the fastest clustering algorithms available.<cite>[https://scikit-learn.org/stable/modules/generated/sklearn.cluster.KMeans.html]</cite> | 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.<cite>[https://datafloq.com/read/7-innovative-uses-of-clustering-algorithms/6224]</cite> The k-means algorithm is one of the fastest clustering algorithms available.<cite>[https://scikit-learn.org/stable/modules/generated/sklearn.cluster.KMeans.html KMeans]scikit-learn.org</cite> | ||
== References == | |||
Revision as of 17:10, 31 March 2020
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.KMeansscikit-learn.org