EM Algorithm is short for Expectation-Maximization Algorithm. It's an iterative method to find maximum likelihood in statistical models where the model depends on unobserved latend variables.
Properties:
It used when the dataset is incomplete.
It's an unsupervised model.
Example:
We have a transcript, but we don't know which class the students belong to.
1. Initial guess:
2. Expectation Step: Using the initial guess, we got the value of the marigianal likelihood (prior proabaility).
The probability density function:
3. Maximization Step: Using the probability to update the Gaussian distribution.
4. Iterate step2 and step3 until find the maximum likelihood.
Related:
Gaussian Distribution (Normal Distribution): If the random variable X obeys a normal distribution with mathematical expectation μ and variance σ2, denoted as N(μ,σ2). Its probability density function determines its position for the expected value μ of a normal distribution, and its standard deviation σ determines the magnitude of the distribution. The normal distribution when μ = 0 and σ = 1 is the standard normal distribution.
Probability Density Function:

网友评论