The aim of the algorithm is to cluster n points (samples or observations) into k groups in which each point belongs to the cluster with the nearest mean. This process continues until there is no change in the clusters or the algorithm has reached the limit of iteration.
The algorithm has 3 values of interest: the number of points, k (number of clusters) and the number of iterations.
The code was designed in a way you can watch the movement of the cluster at each iteration.
If you are facing any trouble you can contact me by email.
my email is: email@example.com
Orlando Ramirez Barron (2020). k-means clustering (https://www.mathworks.com/matlabcentral/fileexchange/71796-k-means-clustering), MATLAB Central File Exchange. Retrieved .