메뉴 건너뛰기




Volumn 23, Issue 3, 2008, Pages 469-486

Acceleration of the em algorithm using the vector epsilon algorithm

Author keywords

Acceleration of convergence; The EM algorithm; The Louis's EM algorithm; The vector algorithm

Indexed keywords


EID: 47749116471     PISSN: 09434062     EISSN: 16139658     Source Type: Journal    
DOI: 10.1007/s00180-007-0089-1     Document Type: Article
Times cited : (15)

References (14)
  • 3
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the em algorithm
    • Dempster AP, Laird NM and Rubin DB (1977). Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc Ser B 39: 1-22
    • (1977) J R Stat Soc ser B , vol.39 , pp. 1-22
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 4
    • 21144460553 scopus 로고
    • Conjugate gradient acceleration of the em algorithm
    • Jamshidian M and Jennrich RI (1993). Conjugate gradient acceleration of the EM algorithm. J Am Stat Assoc 88: 221-228
    • (1993) J Am Stat Assoc , vol.88 , pp. 221-228
    • Jamshidian, M.1    Jennrich, R.I.2
  • 5
    • 0009568899 scopus 로고    scopus 로고
    • Acceleration of the em algorithm by using quasi-Newton methods
    • Jamshidian M and Jennrich RI (1997). Acceleration of the EM algorithm by using quasi-Newton methods. J R Stat Soc Ser B 59: 569-587
    • (1997) J R Stat Soc ser B , vol.59 , pp. 569-587
    • Jamshidian, M.1    Jennrich, R.I.2
  • 6
    • 33750683002 scopus 로고    scopus 로고
    • Accelerating the convergence of the em algorithm using the vector ε algorithm
    • Kuroda M and Sakakihara M (2006). Accelerating the convergence of the EM algorithm using the vector ε algorithm. Comput Stat Data Anal 51: 1549-1561
    • (2006) Comput Stat Data Anal , vol.51 , pp. 1549-1561
    • Kuroda, M.1    Sakakihara, M.2
  • 7
    • 80051593425 scopus 로고
    • Maximum likelihood computations with repeated measures: Application of the em algorithm
    • Laird NM, Lange K and Stram DO (1987). Maximum likelihood computations with repeated measures: application of the EM algorithm. J Am Stat Ass 82: 97-105
    • (1987) J Am Stat Ass , vol.82 , pp. 97-105
    • Laird, N.M.1    Lange, K.2    Stram, D.O.3
  • 8
    • 0002414768 scopus 로고
    • A quasi Newton acceleration of the em algorithm
    • Lange K (1995). A quasi Newton acceleration of the EM algorithm. Stat Sin 5: 1-18
    • (1995) Stat Sin , vol.5 , pp. 1-18
    • Lange, K.1
  • 9
    • 0001044972 scopus 로고
    • Finding the observed information matrix when using the em algorithm
    • Louis TA (1982). Finding the observed information matrix when using the EM algorithm. J R Stat Soc Ser B 44: 226-233
    • (1982) J R Stat Soc ser B , vol.44 , pp. 226-233
    • Louis, T.A.1
  • 10
    • 0001232538 scopus 로고
    • A fast improvement to the em algorithm on its own terms
    • Meilijson I (1989). A fast improvement to the EM algorithm on its own terms. J Roy Stat Soc Ser B 51: 127-138
    • (1989) J Roy Stat Soc ser B , vol.51 , pp. 127-138
    • Meilijson, I.1
  • 11
    • 38149148314 scopus 로고
    • On the global and componentwise rates of convergence of the em algorithm
    • Meng XL and Rubin DB (1994). On the global and componentwise rates of convergence of the EM algorithm. Linear Algebra Appli 199: 413-425
    • (1994) Linear Algebra Appli , vol.199 , pp. 413-425
    • Meng, X.L.1    Rubin, D.B.2
  • 13
    • 84968486263 scopus 로고
    • The epsilon algorithm and operational formulas of numerical analysis
    • Wynn P (1961). The epsilon algorithm and operational formulas of numerical analysis. Math Comp 15: 151-158
    • (1961) Math Comp , vol.15 , pp. 151-158
    • Wynn, P.1
  • 14
    • 84968509237 scopus 로고
    • Acceleration techniques for iterated vector and matrix problems
    • Wynn P (1962). Acceleration techniques for iterated vector and matrix problems. Math Comp 16: 301-322
    • (1962) Math Comp , vol.16 , pp. 301-322
    • Wynn, P.1


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