On EM algorithms and their proximal generalizations

Details On EM algorithms and their proximal generalizations On EM algorithms and their proximal generalizations

2012-01-27

arxiv.org/abs/1201.5912v1

ESAIM: Probability and Statistics (2008) 12 pp. 308--326

Statistics

Computation

Scientific paper

In this paper, we analyze the celebrated EM algorithm from the point of view of proximal point algorithms. More precisely, we study a new type of generalization of the EM procedure introduced in \cite{Chretien&Hero:98} and called Kullback-proximal algorithms. The proximal framework allows us to prove new results concerning the cluster points. An essential contribution is a detailed analysis of the case where some cluster points lie on the boundary of the parameter space.

Affiliated with

Also associated with

No associations

Rating

On EM algorithms and their proximal generalizations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On EM algorithms and their proximal generalizations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On EM algorithms and their proximal generalizations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-257099