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 1D data with a mixture of 2 Gaussians using the EM
algorithm. A GMM with 1D data represents a distribution as
p(x)= X
K
k=1
\pi kN (x |k,\sigma k)
with \pi k the mixing coefficients, where: PK
k=1\pi k =1 and \pi k >=0,k. And,
N (x |k,\sigma k)=1
q
2\pi \sigma 2
k
exp(
(x k)
2
2\sigma
2
k
)
2
You are given the l-D data points X ={1,10,20}. Suppose the output of the E step is the following
matrix:
R =
10
0.40.6
01
where entry ri,c 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.
(1) Write down the likelihood function you are trying to optimize.
(2) After performing the M step for the mixing weights \pi 1,\pi 2, what are the new values?
(3) After performing the M step for the means 1 and 2, what are the new values?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!