Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
we calculate the number of data points belonging to label =1 for our supervised data, then N1 = P(label = 1 | x1) + P(label = 1| x2) + P(label = 1| x3) + P(label = 1 | x4) + …. P(label = 1 | x10) = 0+1+0+1+1+0+0+0+1+0 = 4. And in the dataset, there are 4 points belonging to label = 1. N1 is the