Dechipering K-Means Algorithm - DZone AI

The k-means is a simple algorithm that divides the data set into k partitions for n objects where k n. In this method, the data set is partitioned into homogeneous groups with similar characteristics. The similarity or dissimilarity is defined by calculating the distance between the centroid and data points. The clusters are formed when the optimization function for the algorithm achieves its objective -- less intracluster distances and more intercluster distances. Repeat steps 3 and 4 until the centroids in clusters change.