Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
every step of the EM algorithm are guaranteed to increase to the log-likelihood, which will prove in part 2 of the series. Before, going at a solved example of the EM algorithm for our data in fig (1), here are some facts summarizing the EM algorithm (some of them will be proved in part 2 of the