Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
of it. Expectation maximization is an iterative algorithm that maximizes the maximum likelihood estimation of data in the presence of latent variables. The algorithm can be used in many unsupervised tasks such as clustering, dimensionality reduction, etc. In this article, we will discuss GMM