Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
inside the cluster have inter-point distances smaller compared to the points outside the cluster. We do this by introducing K d-dimensional random points μₖ corresponding to each Kth cluster, these points are cluster centroid. Now we want to assign each point in a way that the sum of the squares of