Gaussian Mixture Model (GMM)
Here we set following symbols
: ( n= 1 ~ N)
: (k = 1~K)
: (k = 1~K)
: (k = 1~K)
:
:
:
: (k = 1 ~ K)
represents probability states in samples ()
represents probability of length = states, ()only when , it would be counted into , random variable
Goal:
think about the Expectation–maximization algorithm
where
suppose independent
Here
Hence
notice: is fixed, are variables, we turn to replace it with
EM method
[M step] fix , change
fix
where
[E step] fix , change
fix
when , wen have
When reaches the minimal value 0,then have
update ,to keep current value
in all
So
Calculation of [M step] fix , change
fix
where
Here
Now find close form of Q
is [probability distribution] random variable of [probability distribution] random variable
Here
Here
So, have
maximize Q
define
for
so
Hence
for
so
Hence
for
note: , so
So
So
To sum up
For M step
where, have
For E step
here is (N x 1) matrix