Expectation conditional maximization (ECM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)

From Algorithm Wiki

Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n+r)$? words (Stores current theta and Z guesses, which is updated each iteration. Also assumes description of log-likelihood takes O(n+r) auxiliary space.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1993 == Reference == https://academic.oup.com/biomet/article-abstract/80/2/267/251605?redirectedFrom=fulltext")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O(n+r)$? words

(Stores current theta and Z guesses, which is updated each iteration. Also assumes description of log-likelihood takes O(n+r) auxiliary space.)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1993

Reference

https://academic.oup.com/biomet/article-abstract/80/2/267/251605?redirectedFrom=fulltext

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Expectation_conditional_maximization_(ECM)_(Maximum_Likelihood_Methods_in_Unknown_Latent_Variables_Maximum_Likelihood_Methods_in_Unknown_Latent_Variables)&oldid=44931"