Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
basic idea of K-means clustering is discussed below (in order to motivate discussion of GMM). Suppose a D dimensional random variable X and we have N sample points {x₁,x₂,….xₙ} of that variable, our goal is to partition data into K sets of clusters. The notion of the cluster is that all points