Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
In discussing GMM, we will introduce the expectation-maximization algorithm and later derive a general form of it. Let’s look at the example of clustering. Clustering aims to find groups or chunks in data based on some measure. Below we have unlabelled data on the left plotted in fig (a), and on