8 edited title

# understanding Understanding the E step of EM for GMM

7 added 123 characters in body

I'm reading this chapter about EM (9.3.1) of the book "Pattern Recognition and Machine Learning".

I understand the basic EM algorithm for GMM, but I'm having some problems understanding the probabilistic interpretation of the E step.

Most of the following formulas make sense to me except 9.39. Can someone please explain it for me? Thanks a lot.

It seems that it is in the form of $$E[z_{nk}]=\frac{\sum_{z_{nk}}z_{nk}f(n,k)}{normalizer}$$ where the numerator is a summation over two possible states of $$z_{nk}$$ (0 and 1), so it becomes $$\pi_kN(x_n|\mu_k,\Sigma_k)$$ in the second step, am I right so far?

If so, what are we summing over here in the denominator? 0s and 1s of all possible $$j$$s (but the result doesn't quite match)? it seems to make more sense if the denominator is the normalized zeroth momentWhy (in the same form$$f(n,k)=[\pi_kN(x_n|\mu_k,\Sigma_k)]^{z_{nk}}$$ is used as the denominator in the second step).an unnormalized probability?

It would make more sense if the denominator is the unnormalized zeroth moment and the numerator is the unnormalized first moment, did I understand it correctly?

I'm reading this chapter about EM (9.3.1) of the book "Pattern Recognition and Machine Learning".

I understand the basic EM algorithm for GMM, but I'm having some problems understanding the probabilistic interpretation of the E step.

Most of the following formulas make sense to me except 9.39. Can someone please explain it for me? Thanks a lot.

It seems that it is in the form of $$E[z_{nk}]=\frac{\sum_{z_{nk}}z_{nk}f(n,k)}{normalizer}$$ where the numerator is a summation over two possible states of $$z_{nk}$$ (0 and 1), so it becomes $$\pi_kN(x_n|\mu_k,\Sigma_k)$$ in the second step, am I right so far?

If so, what are we summing over here in the denominator? 0s and 1s of all possible $$j$$s (but the result doesn't quite match)? it seems to make more sense if the denominator is the normalized zeroth moment (in the same form as the denominator in the second step).

I'm reading this chapter about EM (9.3.1) of the book "Pattern Recognition and Machine Learning".

I understand the basic EM algorithm for GMM, but I'm having some problems understanding the probabilistic interpretation of the E step.

Most of the following formulas make sense to me except 9.39. Can someone please explain it for me? Thanks a lot.

It seems that it is in the form of $$E[z_{nk}]=\frac{\sum_{z_{nk}}z_{nk}f(n,k)}{normalizer}$$ where the numerator is a summation over two possible states of $$z_{nk}$$ (0 and 1), so it becomes $$\pi_kN(x_n|\mu_k,\Sigma_k)$$ in the second step, am I right so far?

If so, what are we summing over here in the denominator? 0s and 1s of all possible $$j$$s (but the result doesn't quite match)? Why $$f(n,k)=[\pi_kN(x_n|\mu_k,\Sigma_k)]^{z_{nk}}$$ is used as an unnormalized probability?

It would make more sense if the denominator is the unnormalized zeroth moment and the numerator is the unnormalized first moment, did I understand it correctly?

6 added 137 characters in body

I'm reading this chapter about EM (9.3.1) of the book "Pattern Recognition and Machine Learning".

I understand the basic EM algorithm for GMM, but I'm having some problems understanding the probabilistic interpretation of the E step.

Most of the following formulas make sense to me except 9.39. Can someone please explain it for me? Thanks a lot.

It seems that it is in the form of $$E[z_{nk}]=\frac{\sum_{z_{nk}}z_{nk}f(n,k)}{normalizer}$$ where the numerator is a summation over two possible states of $$z_{nk}$$ (0 and 1), so it becomes $$\pi_kN(x_n|\mu_k,\Sigma_k)$$ in the second step, am I right so far?

If so, what are we summing over here in the denominator? 0s and 1s of all possible $$j$$s (but the result doesn't quite match)? it seems to make more sense if the denominator is the normalized zeroth moment (in the same form as the denominator in the second step).

I'm reading this chapter about EM (9.3.1) of the book "Pattern Recognition and Machine Learning".

I understand the basic EM algorithm for GMM, but I'm having some problems understanding the probabilistic interpretation of the E step.

Most of the following formulas make sense to me except 9.39. Can someone please explain it for me? Thanks a lot.

It seems that it is in the form of $$E[z_{nk}]=\frac{\sum_{z_{nk}}z_{nk}f(n,k)}{normalizer}$$ where the numerator is a summation over two possible states of $$z_{nk}$$ (0 and 1), so it becomes $$\pi_kN(x_n|\mu_k,\Sigma_k)$$ in the second step, am I right so far?

If so, what are we summing over here in the denominator? 0s and 1s of all possible $$j$$s (but the result doesn't quite match)?

I'm reading this chapter about EM (9.3.1) of the book "Pattern Recognition and Machine Learning".

I understand the basic EM algorithm for GMM, but I'm having some problems understanding the probabilistic interpretation of the E step.

Most of the following formulas make sense to me except 9.39. Can someone please explain it for me? Thanks a lot.

It seems that it is in the form of $$E[z_{nk}]=\frac{\sum_{z_{nk}}z_{nk}f(n,k)}{normalizer}$$ where the numerator is a summation over two possible states of $$z_{nk}$$ (0 and 1), so it becomes $$\pi_kN(x_n|\mu_k,\Sigma_k)$$ in the second step, am I right so far?

If so, what are we summing over here in the denominator? 0s and 1s of all possible $$j$$s (but the result doesn't quite match)? it seems to make more sense if the denominator is the normalized zeroth moment (in the same form as the denominator in the second step).

5 added 37 characters in body
4 deleted 101 characters in body
3 deleted 1 character in body
2 added 8 characters in body
1