Header
Home | Sitemap Set as homepage | Add to favorites
  Search the Site     » Advanced Search
Sections



Sequential EM Algorithm

by

image

Sequential EM Algorithm

The EM algorithm discussed above is a batch algorithm. We next briefly describe a sequential version of the EM algorithm [482, 563]. Suppose that y1, y2, ... is a sequence of observations with marginal pdf f(y|q), where q Cm is a static parameter vector. A class of sequential estimators derived from the maximum-likelihood principle is given by

Equation 9.42

graphics/09equ042.gif


where q(i) is the estimate of q at the ith step, P(yi+1,q(i)) is an m x m matrix defined later in this section, and

Equation 9.43

graphics/09equ043.gif


is the update score (i.e., the gradient of the log-likelihood function). Let H(yi, q(i)) denote the Hessian matrix of log f(yi|q(i)):

Equation 9.44

graphics/09equ044.gif


Let xi denote a "complete" data set related to yi for i = 1,2, .... The complete data set xi is selected in the (sequential) EM algorithm such that yi can be obtained through a many-to-one mapping xi yi, and so that its knowledge makes the estimation problem easy [e.g., the conditional density f(xi|q) can easily be obtained]. Denote the Fisher information matrices of the data yi and xi, respectively, as

graphics/513fig01.gif

Different versions of sequential estimation algorithms are characterized by different choices of the function P(yi+1,q(i)) in (9.42), as follows.


160 times read

Related news

» Intelligent Paging Scheme
by admin posted on Oct 24,2006
» Antenna Characteristics
by admin posted on Jul 15,2007
» Design of Product-Brokering Agent
by admin posted on Apr 23,2007
» Segment Transmission and Retransmission
by admin posted on Dec 10,2006
» Design of Product-Brokering Agent
by admin posted on Jul 25,2007


More Top News
Cisco Wireless Networking
Most Popular
Featured Author