메뉴 건너뛰기




Volumn 49, Issue 1, 2005, Pages 147-167

Minimum message length estimation using EM methods: A case study

Author keywords

Comparative calibration; EM algorithm; Functional relationship; Maximum penalized likelihood; Minimum message length; Structural relationship

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); MATHEMATICAL MODELS; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION; VECTORS;

EID: 13644264350     PISSN: 01679473     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.csda.2004.05.005     Document Type: Article
Times cited : (3)

References (15)
  • 1
    • 0041908169 scopus 로고    scopus 로고
    • Finding overlapping components with MML
    • R.A. Baxter, and J.J. Oliver Finding overlapping components with MML Statist. Comput. 10 2000 5 16
    • (2000) Statist. Comput. , vol.10 , pp. 5-16
    • Baxter, R.A.1    Oliver, J.J.2
  • 2
    • 10344223937 scopus 로고
    • Structural comparative calibration using the EM algorithm
    • H. Bolfarine, and M.G. Rojas Structural comparative calibration using the EM algorithm J. Appl. Statist. 22 1995 277 292
    • (1995) J. Appl. Statist. , vol.22 , pp. 277-292
    • Bolfarine, H.1    Rojas, M.G.2
  • 3
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the EM algorithm (with discussion)
    • A.P. Dempster, N.M. Laird, and D.B. Rubin Maximum likelihood from incomplete data via the EM algorithm (with discussion) J. Roy. Statist. Soc. B 39 1977 1 38
    • (1977) J. Roy. Statist. Soc. B , vol.39 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 4
    • 0036271820 scopus 로고    scopus 로고
    • The complexity of strict minimum message length inference
    • G. Farr, and C. Wallace The complexity of strict minimum message length inference Comput. J. 45 2002 285 292
    • (2002) Comput. J. , vol.45 , pp. 285-292
    • Farr, G.1    Wallace, C.2
  • 5
    • 0000357775 scopus 로고
    • On the use of the EM algorithm for penalized likelihood estimation
    • P.G. Green On the use of the EM algorithm for penalized likelihood estimation J. Roy. Statist. Soc. B 52 1990 443 452
    • (1990) J. Roy. Statist. Soc. B , vol.52 , pp. 443-452
    • Green, P.G.1
  • 6
    • 0001890697 scopus 로고
    • On deriving the inverse of a sum of matrices
    • H.V. Henderson, and S.R. Searle On deriving the inverse of a sum of matrices SIAM Rev. 23 1981 53 60
    • (1981) SIAM Rev. , vol.23 , pp. 53-60
    • Henderson, H.V.1    Searle, S.R.2
  • 10
    • 34250232348 scopus 로고
    • EM algorithms for ML factor analysis
    • D.B. Rubin, and D.T. Thayer EM algorithms for ML factor analysis Psychometrika 47 1982 69 76
    • (1982) Psychometrika , vol.47 , pp. 69-76
    • Rubin, D.B.1    Thayer, D.T.2
  • 12
    • 0018139406 scopus 로고
    • Comparative calibration, linear structural relationship and congeneric measurements
    • C.M. Theobald, and J.R. Mallison Comparative calibration, linear structural relationship and congeneric measurements Biometrics 34 1978 39 45
    • (1978) Biometrics , vol.34 , pp. 39-45
    • Theobald, C.M.1    Mallison, J.R.2
  • 13
    • 0000107517 scopus 로고
    • An information measure for classification
    • C.S. Wallace, and D.M. Boulton An information measure for classification Comput. J. 11 1968 185 194
    • (1968) Comput. J. , vol.11 , pp. 185-194
    • Wallace, C.S.1    Boulton, D.M.2
  • 14
  • 15
    • 0000905970 scopus 로고
    • Single factor analysis by minimum message length estimation
    • C.S. Wallace, and P.R. Freeman Single factor analysis by minimum message length estimation J. Roy. Statist. Soc. B 54 1992 195 209
    • (1992) J. Roy. Statist. Soc. B , vol.54 , pp. 195-209
    • Wallace, C.S.1    Freeman, P.R.2


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