Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
(one with minimum distance). Re-compute the centroid for each K cluster, based on the points inside the cluster. Repeat the above steps for a fixed number of iterations or convergence is reached. K-means clustering on a dataset in fig (a) left The above figure shows the result of k-means clustering