On-line expectation-maximization algorithm for latent data models

We propose a generic on-line (also sometimes called adaptive or recursive) version of the expectation-maximization (EM) algorithm applicable to latent variable models of independent observations. Compared with the algorithm of Titterington, this approach is more directly connected to the usual EM al...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of the Royal Statistical Society. Series B, Statistical methodology Ročník 71; číslo 3; s. 593 - 613
Hlavní autoři: Cappé, Olivier, Moulines, Eric
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford, UK Oxford, UK : Blackwell Publishing Ltd 01.06.2009
Blackwell Publishing Ltd
Blackwell Publishing
Blackwell
Royal Statistical Society
Oxford University Press
Edice:Journal of the Royal Statistical Society Series B
Témata:
ISSN:1369-7412, 1467-9868
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We propose a generic on-line (also sometimes called adaptive or recursive) version of the expectation-maximization (EM) algorithm applicable to latent variable models of independent observations. Compared with the algorithm of Titterington, this approach is more directly connected to the usual EM algorithm and does not rely on integration with respect to the complete-data distribution. The resulting algorithm is usually simpler and is shown to achieve convergence to the stationary points of the Kullback-Leibler divergence between the marginal distribution of the observation and the model distribution at the optimal rate, i.e. that of the maximum likelihood estimator. In addition, the approach proposed is also suitable for conditional (or regression) models, as illustrated in the case of the mixture of linear regressions model.
Bibliografie:http://dx.doi.org/10.1111/j.1467-9868.2009.00698.x
istex:E2609E9328DE5FE711064DD5372E693A31AF7354
ark:/67375/WNG-LJHDP3BQ-S
ArticleID:RSSB698
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1369-7412
1467-9868
DOI:10.1111/j.1467-9868.2009.00698.x