# What is the computational complexity of the EM algorithm?

In general, and more specifically for Bernoulli mixture model (aka Latent Class Analysis).

-

I do not think you can compute the complexity in the usual way. How long it takes the EM algortihm depends on the starting point, the shape of the likelihood and the stopping criterion.

-
You can do the computational cost per iteration, though. Of course, for a given problem there might be different ways of implementing the same EM procedure with different computational complexities. –  guy Nov 7 '13 at 3:21