Transcription of Gaussian mixture models and the EM algorithm
{{id}} {{{paragraph}}}
Example: air traffic controller
Gaussian mixture models and the EM algorithm
Gaussian mixture models and the EM algorithmRamesh Sridharan These notes give a short introduction to Gaussian mixture models (GMMs) and theExpectation-Maximization (EM) algorithm , first for the specific case of GMMs, and thenmore generally. These notes assume you re familiar with basic probability and basic you re interested in the full derivation (Section 3), some familiarity with entropy and KLdivergence is useful but not strictly notation here is borrowed fromIntroduction to Probabilityby Bertsekas & Tsitsiklis:random variables are represented with capital letters, values they take are represented withlowercase letters,pXrepresents a probability distribution for random variableX, andpX(x)represents the probability of valuex(according topX).
groups: the groups might be di erent from each other, but data points within the same group can be well-modeled by a Gaussian distribution. 2.1 Examples For example, suppose the price of a randomly chosen paperback book is normally distributed ... At this point, we’re stuck. We have a mix of ratios of exponentials and linear terms, and
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: