메뉴 건너뛰기




Volumn 145, Issue 5, 2010, Pages 1757-1775

Simplicity and likelihood: An axiomatic approach

Author keywords

Akaike Information Criterion; Axioms; Maximum likelihood; Minimum Description Length; Model selection; Simplicity

Indexed keywords


EID: 77955922930     PISSN: 00220531     EISSN: 10957235     Source Type: Journal    
DOI: 10.1016/j.jet.2010.03.010     Document Type: Article
Times cited : (14)

References (18)
  • 1
    • 0016355478 scopus 로고
    • A new look at the statistical model identification
    • Akaike H. A new look at the statistical model identification. IEEE Trans. Automat. Control 1974, 19(6):716-723.
    • (1974) IEEE Trans. Automat. Control , vol.19 , Issue.6 , pp. 716-723
    • Akaike, H.1
  • 2
    • 27844436123 scopus 로고    scopus 로고
    • Probabilities as similarity-weighted frequencies
    • Billot A., Gilboa I., Samet D., Schmeidler D. Probabilities as similarity-weighted frequencies. Econometrica 2005, 73:1125-1136.
    • (2005) Econometrica , vol.73 , pp. 1125-1136
    • Billot, A.1    Gilboa, I.2    Samet, D.3    Schmeidler, D.4
  • 3
    • 84918358658 scopus 로고
    • On the length of programs for computing binary sequences
    • Chaitin G.J. On the length of programs for computing binary sequences. J. Assoc. Comp. Machines 1966, 13:547-569.
    • (1966) J. Assoc. Comp. Machines , vol.13 , pp. 547-569
    • Chaitin, G.J.1
  • 6
    • 77955924451 scopus 로고    scopus 로고
    • Subjectivity in inductive inference, mimeo,.
    • I. Gilboa, L. Samuelson, Subjectivity in inductive inference, mimeo, 2009.
    • (2009)
    • Gilboa, I.1    Samuelson, L.2
  • 8
    • 0037273317 scopus 로고    scopus 로고
    • Inductive inference: an axiomatic approach
    • Gilboa I., Schmeidler D. Inductive inference: an axiomatic approach. Econometrica 2003, 71:1-26.
    • (2003) Econometrica , vol.71 , pp. 1-26
    • Gilboa, I.1    Schmeidler, D.2
  • 9
    • 0007424433 scopus 로고
    • On tables of random numbers
    • Kolmogorov A.N. On tables of random numbers. Sankhya Ser. A 1963, 369-376.
    • (1963) Sankhya Ser. A , pp. 369-376
    • Kolmogorov, A.N.1
  • 10
    • 0001902056 scopus 로고
    • Three approaches to the quantitative definition of information
    • Kolmogorov A.N. Three approaches to the quantitative definition of information. Probab. Inf. Transm. 1965, 1:4-7.
    • (1965) Probab. Inf. Transm. , vol.1 , pp. 4-7
    • Kolmogorov, A.N.1
  • 13
    • 0001745298 scopus 로고
    • The interpretation of interaction in contingency tables
    • Simpson E.H. The interpretation of interaction in contingency tables. J. Roy. Statist. Soc. Ser. B 1951, 13:238-241.
    • (1951) J. Roy. Statist. Soc. Ser. B , vol.13 , pp. 238-241
    • Simpson, E.H.1
  • 14
    • 0004277579 scopus 로고
    • Clarendon Press, Oxford
    • Sober E. Simplicity 1975, Clarendon Press, Oxford.
    • (1975) Simplicity
    • Sober, E.1
  • 15
    • 4544279425 scopus 로고
    • A formal theory of inductive inference I, II
    • 224-254
    • Solomonoff R. A formal theory of inductive inference I, II. Inf. Control 1964, 7:1-22. 224-254.
    • (1964) Inf. Control , vol.7 , pp. 1-22
    • Solomonoff, R.1
  • 16
    • 33847323262 scopus 로고    scopus 로고
    • Statistical and Inductive Inference by Minimum Message Length
    • Springer
    • Wallace C.S. Statistical and Inductive Inference by Minimum Message Length. Inf. Sci. Stat. 2005, Springer.
    • (2005) Inf. Sci. Stat.
    • Wallace, C.S.1
  • 17
    • 0000107517 scopus 로고
    • An information measure for classification
    • Wallace C.S., Boulton D.M. An information measure for classification. Comput. J. 1968, 13:185-194.
    • (1968) Comput. J. , vol.13 , pp. 185-194
    • Wallace, C.S.1    Boulton, D.M.2
  • 18
    • 0032684826 scopus 로고    scopus 로고
    • Minimum message length and Kolmogorov complexity
    • Wallace C.S., Dowe D.L. Minimum message length and Kolmogorov complexity. Comput. J. 1999, 42:270-283.
    • (1999) Comput. J. , vol.42 , pp. 270-283
    • Wallace, C.S.1    Dowe, D.L.2


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