Google
×

Expectation–maximization algorithm

In statistics, an expectation–maximization algorithm is an iterative method to find maximum likelihood or maximum a posteriori estimates of parameters in statistical models, where the model depends on unobserved latent variables. Wikipedia