Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
with K clusters and N data points. As it is assumed in MLE that each data point is independent of the other, then by probability/likelihood of data P(X|θ) by probability theory is given as Equation (4) And the log-likelihood is given as: Equation (5) Now we have to maximize the above equation with