<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Expectation Maximization on Arshad Siddiqui</title><link>https://arshadhs.github.io/tags/expectation-maximization/</link><description>Recent content in Expectation Maximization on Arshad Siddiqui</description><generator>Hugo</generator><language>en-us</language><atom:link href="https://arshadhs.github.io/tags/expectation-maximization/index.xml" rel="self" type="application/rss+xml"/><item><title>Gaussian Mixture Model &amp; Expectation Maximization</title><link>https://arshadhs.github.io/docs/ai/statistics/060-gaussian-mixture-model-em/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://arshadhs.github.io/docs/ai/statistics/060-gaussian-mixture-model-em/</guid><description>&lt;h1 id="gaussian-mixture-model--expectation-maximization">
 Gaussian Mixture Model &amp;amp; Expectation Maximization
 
 &lt;a class="anchor" href="#gaussian-mixture-model--expectation-maximization">#&lt;/a>
 
&lt;/h1>
&lt;p>A Gaussian Mixture Model represents data as a weighted combination of multiple Gaussian distributions.&lt;/p>
&lt;p>It is commonly used for soft clustering and density estimation.&lt;/p>
&lt;blockquote class="book-hint info">
&lt;p>&lt;strong>Key takeaway:&lt;/strong>&lt;br>
K-means gives hard cluster membership.&lt;/p>
&lt;p>GMM gives probabilities of belonging to each cluster.&lt;/p>
&lt;/blockquote>
&lt;ul>
&lt;li>Gaussian Mixture Model&lt;/li>
&lt;li>soft clustering&lt;/li>
&lt;li>mixing coefficients&lt;/li>
&lt;li>latent variables&lt;/li>
&lt;li>likelihood and log-likelihood&lt;/li>
&lt;li>Expectation-Maximization algorithm&lt;/li>
&lt;li>E-step and M-step&lt;/li>
&lt;li>responsibilities&lt;/li>
&lt;li>convergence&lt;/li>
&lt;/ul>
&lt;hr>
&lt;h2 id="motivation-">
 Motivation ☆
 
 &lt;a class="anchor" href="#motivation-">#&lt;/a>
 
&lt;/h2>
&lt;p>Many real datasets are not described well by one Gaussian distribution.&lt;/p></description></item></channel></rss>