Question: In this question we consider clustering 1 D data with a mixture of 2 Gaussians using the EM algorithm. A GMM with 1 D data
In this question we consider clustering D data with a mixture of Gaussians using the EM
algorithm. A GMM with D data represents a distribution as
px X
K
k
pi kN x ksigma k
with pi k the mixing coefficients, where: PK
kpi k and pi k k And,
N x ksigma k
q
pi sigma
k
exp
x k
sigma
k
You are given the lD data points X Suppose the output of the E step is the following
matrix:
R
where entry ric is the probability of obervation Xi belonging to cluster c the responsibility of
cluster c for data point i You just have to compute the M step. You may state the equations for
maximum likelihood estimates of these quantities which you should know from the lecture and
apply to this data set.
Write down the likelihood function you are trying to optimize.
After performing the M step for the mixing weights pi pi what are the new values?
After performing the M step for the means and what are the new values?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
