The Regularized EM Algorithm

Abstract

The EM algorithm heavily relies on the interpretation of observations as incomplete data but it does not have any control on the uncertainty of missing data. To effectively reduce the uncertainty of missing data, we present a regularized EM algorithm that penalizes the likelihood with the mutual information between the missing data and the incomplete data (or the conditional entropy of the missing data given the observations). The proposed method maintains the advantage of the conventional EM algorithm, such as reliable global convergence, low cost per iteration, economy of storage, and ease of programming. We also apply the regularized EM algorithm to fit the finite mixture model. Our theoretical analysis and experiments show that the new method can efficiently fit the models and effectively simplify over-complicated models.

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@inproceedings{Li2005TheRE, title={The Regularized EM Algorithm}, author={Haifeng Li and Keshu Zhang and Tao Jiang}, booktitle={AAAI}, year={2005} }