Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
each data point x, we have an associated cluster id. We can denote the weighing coefficient π1, π2, π3,…πk as the probability of observing cluster-id 1,2,3,…k respectively in the given dataset. Intuitively we are modeling the probability of kth cluster-id appearing in the dataset. Hence the