K-means clustering: Difference between revisions

From Machinelearning
No edit summary
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.<ref>[https://datafloq.com/read/7-innovative-uses-of-clustering-algorithms/6224 7 Innovative Uses of Clustering Algorithms in the Real World]datafloq.com</ref> The k-means algorithm is one of the fastest clustering algorithms available.<ref>[https://scikit-learn.org/stable/modules/generated/sklearn.cluster.KMeans.html KMeans]scikit-learn.org</ref> K-Means can group data only unsupervised based on the similarity of customers to each other. It is a type of partitioning [[clustering]], as it divides the data into K non-overlapping subsets or clusters without any cluster internal structure or labels.<ref name="coursera">[https://www.coursera.org/learn/machine-learning-with-python/lecture/Ky5Wf/intro-to-k-means Intro to k-Means]Coursera</ref>
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.<ref>[https://datafloq.com/read/7-innovative-uses-of-clustering-algorithms/6224 7 Innovative Uses of Clustering Algorithms in the Real World]datafloq.com</ref> The k-means algorithm is one of the fastest clustering algorithms available.<ref>[https://scikit-learn.org/stable/modules/generated/sklearn.cluster.KMeans.html KMeans]scikit-learn.org</ref> K-means can group data only unsupervised based on the similarity of customers to each other. It is a type of partitioning [[clustering]], as it divides the data into K non-overlapping subsets or clusters without any cluster internal structure or labels. The objective of k-means is to form clusters in such a way that similar samples go into a cluster, and dissimilar samples fall into different clusters.<ref name="coursera">[https://www.coursera.org/learn/machine-learning-with-python/lecture/Ky5Wf/intro-to-k-means Intro to k-Means]Coursera</ref>


== References ==
== References ==

Revision as of 21:05, 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.[2] K-means can group data only unsupervised based on the similarity of customers to each other. It is a type of partitioning clustering, as it divides the data into K non-overlapping subsets or clusters without any cluster internal structure or labels. The objective of k-means is to form clusters in such a way that similar samples go into a cluster, and dissimilar samples fall into different clusters.[3]

References

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