메뉴 건너뛰기
American Statistician
Volumn 51, Issue 1, 1997, Pages 29-31
A Graphical Illustration of the EM Algorithm
Author keywords

Convergence rate; EM algorithm
Indexed keywords

EID: 0031503459     PISSN: 00031305     EISSN: 15372731     Source Type: Journal    
DOI: 10.1080/00031305.1997.10473582     Document Type: Article
Times cited : (11)
References (4)
  • 1
    • 0002629270 scopus 로고
    • Maximum Likelihood from Incomplete Data via the EM Algorithm” (with discussion)
    • Ser. B
    • Dempster, A. P., Laird, N., and Rubin, D. B., 1977. “Maximum Likelihood from Incomplete Data via the EM Algorithm” (with discussion). Journal of the Royal Statistical Society, 39:1–38. Ser. B
    • (1977) Journal of the Royal Statistical Society , vol.39 , pp. 1-38
    • Dempster, A.P.1    Laird, N.2    Rubin, D.B.3
  • 2
    • 0001044972 scopus 로고
    • Finding the Observed Information Matrix when Using the EM Algorithm
    • Ser. B
    • Louis, T. A., 1982. “Finding the Observed Information Matrix when Using the EM Algorithm,”. Journal of the Royal Statistical Society, 44:226–233. Ser. B
    • (1982) Journal of the Royal Statistical Society , vol.44 , pp. 226-233
    • Louis, T.A.1
  • 3
    • 0001953676 scopus 로고
    • Maximum Likelihood Theory for Incomplete Data from an Exponential Family
    • Sundberg, R., 1974. “Maximum Likelihood Theory for Incomplete Data from an Exponential Family,”. Scandinavian Journal of Statistics, 1:49–58.
    • (1974) Scandinavian Journal of Statistics , vol.1 , pp. 49-58
    • Sundberg, R.1
  • 4
    • 0002210265 scopus 로고
    • On the Convergence Properties of the EM Algorithm
    • Wu, C. F. J., 1983. “On the Convergence Properties of the EM Algorithm,”. Annals of Statistics, 11:95–103.
    • (1983) Annals of Statistics , vol.11 , pp. 95-103
    • Wu, C.F.J.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.