UMR CNRS 7253

Site Tools


en:software:e2m

This is an old revision of the document!


Evidential EM (E2M) algorithm

An extension of the Expectation-Maximization (EM) algorithm for parameter estimation in statistical models in the case where data are uncertain and represented as belief functions. The proposed method is based on the maximization of a generalized likelihood criterion, which can be interpreted as a degree of agreement between the statistical model and the uncertain observations. E2M is a variant of the EM algorithm that iteratively maximizes this criterion.

The toolbox provides functions for the following problems: - Probability estimation from uncertain data (Bernoulli model); - Clustering of uncertain categorical data using the latent class model (with the possibility to use uncertain information on class labels); - Clustering of uncertain continuous data using the Gaussian mixture model (with the possibility to use uncertain information on class labels).

References:


User Tools