EM (Expectation–Maximization) Algorithm 思路分析及推導

往期文章鏈接目錄 Jensen’s inequality Theorem: Let f f f be a convex function, and let X X X be a random variable. Then: E [ f ( X ) ] ≥ f ( E [ X ] ) E[f(X)] \geq f(E[X]) E[f(X)]≥f(E[X]) \quad Moreover, if f

>>阅读原文<<