Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
marginal distribution of cluster ids is given by p(z) as: Note in GMM or k-means, or any clustering algorithm we don’t have cluster ids for each data point in our dataset. Now we have both distributions, we can also define the conditional probability of data points x given the kth cluster id as: