Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
formula Where D is the dimension of data, we fit Gaussian by maximum likelihood estimation and it has a general form given as But looking at the structure of data, one gaussian is not a good choice to model the likelihood (distribution) of data, as it has three dense regions or modes, whereas a