The Expectation–maximization algorithm cardExpectation–maximization algorithm

Expectation–maximization algorithm

Uncommon

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “Expectation–maximization algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Chire, CC BY-SA 3.0, via Wikimedia Commons.

Open free boosters and add Expectation–maximization algorithm to your collection.

Play for free

Related cards