Difference between revisions of "Expectation Maximization"
From Cohen Courses
Jump to navigationJump to search (Created page with 'From Wikipedia: In statistics, an expectation-maximization (EM) algorithm is a method for finding maximum likelihood or maximum a posteriori (MAP) estimates of parameters in sta…') |
|||
| Line 7: | Line 7: | ||
== Relevant Papers == | == Relevant Papers == | ||
| − | {{#ask: [[UsesMethod:: | + | {{#ask: [[UsesMethod::Expectation Maximization]] |
| ?AddressesProblem | | ?AddressesProblem | ||
| ?UsesDataset | | ?UsesDataset | ||
}} | }} | ||
Revision as of 18:26, 28 March 2011
From Wikipedia:
In statistics, an expectation-maximization (EM) algorithm is a method for finding maximum likelihood or maximum a posteriori (MAP) estimates of parameters in statistical models, where the model depends on unobserved latent variables. EM is an iterative method which alternates between performing an expectation (E) step, which computes the expectation of the log-likelihood evaluated using the current estimate for the latent variables, and a maximization (M) step, which computes parameters maximizing the expected log-likelihood found on the E step.
