02.09.2014 Views

multivariate poisson hidden markov models for analysis of spatial ...

multivariate poisson hidden markov models for analysis of spatial ...

multivariate poisson hidden markov models for analysis of spatial ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

P<br />

jk<br />

n<br />

∑<br />

vˆ<br />

jk<br />

i=<br />

2<br />

= n m<br />

∑∑<br />

i= 2 l=<br />

1<br />

vˆ<br />

( i)<br />

jl<br />

( i)<br />

. (5.24)<br />

These equations, similar to the equations 5.17 <strong>for</strong> the mixing proportions in a mixture<br />

distribution, can be thought <strong>of</strong> as weighted empirical relative frequencies. The<br />

maximizing values <strong>of</strong><br />

λ<br />

j<br />

are obtained exactly as <strong>for</strong> independent observations. The<br />

algorithm is terminated when the changes in parameter estimates are small.<br />

5.4.2.2 The <strong>for</strong>ward-backward algorithm<br />

The <strong>for</strong>ward-backward algorithm is again an extension <strong>of</strong> univariate case (Chapter 2<br />

and 3) to a <strong>multivariate</strong> case. The <strong>for</strong>ward-backward algorithm is used to calculate the<br />

conditional probabilities uˆ<br />

j<br />

( i)<br />

and ˆ ( i)<br />

. It is based on simple recursive <strong>for</strong>mulae <strong>for</strong><br />

the <strong>for</strong>ward variable<br />

α ( i) = P[ y , y ,..., y , S = j]<br />

and the backward variable<br />

j 1 2 n i<br />

v jk<br />

( i) = P[ y ,..., y | S = j]<br />

(5.25)<br />

β<br />

j i+<br />

1 n i<br />

which yield the quantities <strong>of</strong> interest by<br />

α<br />

j() i β<br />

j() i α<br />

j() i β<br />

j()<br />

i<br />

uˆ j<br />

() i = =<br />

m<br />

∑αl<br />

( n)<br />

α () i β () i<br />

l<br />

∑<br />

j=<br />

1<br />

j<br />

j<br />

and<br />

vˆ<br />

jk<br />

( i)<br />

=<br />

P<br />

jk<br />

f ( y ; λ<br />

i<br />

∑<br />

l<br />

k<br />

) α<br />

j<br />

( i −1)<br />

β<br />

k<br />

( i)<br />

. (5.26)<br />

α ( n)<br />

l<br />

The α (i)<br />

and β (i)<br />

are calculated recursively in i using following <strong>for</strong>mulae:<br />

j<br />

j<br />

95

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!