Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
the distances of each point to its cluster centroid μₖ is minimum. We achieve this objective by an iterative approach as follows: Randomly initialize K cluster centroids μₖ. Compute the distance of each data point with all K cluster centroids. Assign the data point to the closest cluster centroid