This algorithm finds the Maximum likelihood estimates in a model with incomplete data In statistics, an expectation–maximization (EM) algorithm is an iterative method to find 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. These parameter-estimates are then used to determine the distribution of the latent variables in the next E step.
-
Notifications
You must be signed in to change notification settings - Fork 0
adricals90/Expectation-Maximization-EM-
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
This algorithm finds the Maximum likelihood estimates in a model with incomplete data
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published