Maximal likelihood from evidential data: an extension of the EM algorithm - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Maximal likelihood from evidential data: an extension of the EM algorithm

Résumé

We consider the problem of statistical parameter estimation when the data are uncertain and described by belief functions. An extension of the Expectation-Maximization (EM) algorithm, called the Evidential EM (E$^2$M) algorithm, is described and shown to maximize a generalized likelihood function. This general procedure provides a simple mechanism for estimating the parameters in statistical models when observed data are uncertain. The method is illustrated using the problem of univariate normal mean and variance estimation from uncertain data.
Fichier non déposé

Dates et versions

hal-00553506 , version 1 (07-01-2011)

Identifiants

  • HAL Id : hal-00553506 , version 1

Citer

Thierry Denoeux. Maximal likelihood from evidential data: an extension of the EM algorithm. Soft Methods in Probability and Statistics (SMPS 2010), Sep 2010, Oviedo, Spain. pp.181-188. ⟨hal-00553506⟩
43 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More