Expectation–maximization algorithm
ITERATIVE METHOD FOR FINDING MAXIMUM LIKELIHOOD ESTIMATES IN STATISTICAL MODELS
Expectation-Maximization; EM algorithm; Em algorithm; Expectation-maximisation algorithm; Expectation-maximization; Expectation Maximization; EM Algorithm; Expectation-Maximization Clustering; Expectation maximization algorithm; Expectation maximization; Expectation-maximisation; Expectation maximisation; Expectation maximization method; Expectation-maximization method; EM-algorithm; Expectation-maximization algorithm; EM clustering; Expectation Maximisation; Expectation maximization principle
In statistics, an expectation–maximization (EM) algorithm is an iterative method to find (local) maximum likelihood or maximum a posteriori (MAP) estimates of parameters in statistical models, where the model depends on unobserved latent variables. The EM iteration alternates between performing an expectation (E) step, which creates a function for the expectation of the log-likelihood evaluated using the current estimate for the parameters, and a maximization (M) step, which computes parameters maximizing the expected log-likelihood found on the E step.