04.01.2013 Views

Springer - Read

Springer - Read

Springer - Read

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

298 Chapter 8 State-Space Models<br />

Figure 8-6<br />

Monthly number of<br />

U.S. cases of polio,<br />

Jan. ’70–Dec. ’83.<br />

density is assumed to be Poisson with mean exp{xt}, i.e.,<br />

p(yt|xt) ext yt −e e xt<br />

, yt0, 1,..., (8.8.21)<br />

yt!<br />

while the state variables are assumed to follow a regression model with Gaussian<br />

AR(1) noise. If ut (ut1,...,utk) ′ are the regression variables, then<br />

Xt β ′ ut + Wt, (8.8.22)<br />

where β is a k-dimensional regression parameter and<br />

Wt φWt−1 + Zt, {Zt} ∼IID N 0,σ 2 .<br />

The transition density function for the state variables is then<br />

p(xt+1|xt) n(xt+1; β ′ ut+1 + φ xt − β ′ ut), σ 2 . (8.8.23)<br />

The case σ 2 0 corresponds to a log-linear model with Poisson noise.<br />

Estimation of the parameters θ β ′ ,φ,σ2 ′<br />

in the model by direct numerical<br />

maximization of the likelihood function is difficult, since the likelihood cannot be<br />

written down in closed form. (From (8.8.3) the likelihood is the n-fold integral,<br />

∞ <br />

∞ n <br />

··· exp xtyt − e xt<br />

<br />

L θ; x (n) n<br />

(dx1 ···dxn) (yi!),<br />

−∞<br />

−∞<br />

t1<br />

where L(θ; x) is the likelihood based on X1,...,Xn.) To overcome this difficulty,<br />

Chan and Ledolter (1995) proposed an algorithm, called Monte Carlo EM (MCEM),<br />

whose iterates θ (i) converge to the maximum likelihood estimate. To apply this algorithm,<br />

first note that the conditional distribution of Y (n) given X (n) does not depend<br />

0 2 4 6 8 10 12 14<br />

o o<br />

ooo<br />

o<br />

oo<br />

o oo<br />

o<br />

o<br />

o<br />

o o<br />

o<br />

o<br />

o<br />

o<br />

oo<br />

o oo<br />

o o ooo oooo<br />

ooo<br />

oo<br />

o o oo oo o oo<br />

oo<br />

oo<br />

o o o oo oooo<br />

ooooo<br />

oo<br />

o oo o ooo<br />

o o oo oo<br />

o<br />

o<br />

o<br />

o o o o<br />

o<br />

o<br />

o o<br />

o<br />

o<br />

oo o o o o<br />

oo<br />

o<br />

o<br />

o o<br />

o<br />

o<br />

oo<br />

o oo o o o<br />

o o<br />

o<br />

ooo<br />

o o ooo<br />

ooo o ooo o oo ooooo<br />

ooo<br />

o<br />

1970 1972 1974 1976 1978 1980 1982 1984<br />

o<br />

o<br />

i1

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

Saved successfully!

Ooh no, something went wrong!