/ em-explanation Public

Notebooks explaining the intuition behind the Expectation Maximisation algorithm

# ajcr/em-explanation

## Folders and files

NameName
Last commit message
Last commit date

14 Commits

# Expectation Maximisation

Expectation Maximisation gives us a way to estimate model parameters when we are faced with hidden variables. For example, we can estimate distribution parameters for groups of points when we don't know which point belongs to which group:

## Notebooks

These are notebooks explaining the intuition behind the Expectation Maximisation algorithm:

• em-notebook-1 - given sequences of coin flips from two coins, but not knowing which coin generated which sequence, compute each coin's bias towards heads.
• em-notebook-2 - given two equal-size groups of data points drawn from two normal distributions, but not knowing which point came from which group, compute the mean and standard deviation of the distributions.

Expectation Maximisation (EM) is often used to find estimates for model parameters when some variables or data points are not observable. It is an iterative method which allows estimates for a model paramter to be update and ultimately converge to a local (not necessarily global) maximum liklihood value. It is used extensively in finance, bioinformatics and other diciplines, where the central ideas behind the algorithm appear under different guises.

These notebooks are hopefully a source of simple explanations and easy-to-understand code that the reader can tinker with until the basic concept of EM "clicks". They are not intended as a rigorous treatment of the algorithm and its properties (see the Resources section below for other links).

## Other Resources

You may find some of the following resources useful if you want to read more about EM:

## Future

I hope to extend the notebooks to show how other model parameters can be estimated using EM.

I'd also like to add further notebooks explaining how EM is used in real-world applications. For example, transcript quantification with Kallisto.

Notebooks explaining the intuition behind the Expectation Maximisation algorithm

## Releases

No releases published

## Packages 0

No packages published