메뉴 건너뛰기




Volumn 42, Issue 4, 1999, Pages 267-269

Hypothesis selection and testing by the MDL principle

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS;

EID: 0032614642     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (109)

References (17)
  • 1
    • 0000107517 scopus 로고
    • An information measure for classification
    • Wallace, C. S. and Boulton, D. M. (1968) An information measure for classification. Coniput. J., 11, 185-195.
    • (1968) Coniput. J. , vol.11 , pp. 185-195
    • Wallace, C.S.1    Boulton, D.M.2
  • 2
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • Rissanen, J. (1978) Modeling by shortest data description. Aiitomatica, 14,465-471.
    • (1978) Aiitomatica , pp. 465-471
    • Rissanen, J.1
  • 3
    • 0000318553 scopus 로고
    • Stochastic complexity and modeling
    • Rissanen, J. (1986) Stochastic complexity and modeling. Ann. Statist., 14, 1080-1100.
    • (1986) Ann. Statist. , vol.14 , pp. 1080-1100
    • Rissanen, J.1
  • 4
    • 0003757758 scopus 로고
    • Statistical Decision Theory and Bayesian Analysis (2nd edn)
    • Berger, J. O. (1985) Statistical Decision Theory and Bayesian Analysis (2nd edn). Springer, New York.
    • (1985) Springer, New York.
    • Berger, J.O.1
  • 6
    • 33745857503 scopus 로고    scopus 로고
    • Minimum description length induction, Bayesianism, and Kolmogorov complexity
    • Vitdnyi, P. and Li, M. (1997) Minimum description length induction, Bayesianism, and Kolmogorov complexity. Private communication.
    • (1997) Private Communication.
    • Vitdnyi, P.1    Li, M.2
  • 7
    • 0031212926 scopus 로고    scopus 로고
    • Learning about the parameter of the Bernoulli model
    • Vovk, V. ( 1997) Learning about the parameter of the Bernoulli model. J. Compitt. System Sei., 55, 96-104.
    • (1997) J. Compitt. System Sei. , vol.55 , pp. 96-104
    • Vovk, V.1
  • 8
    • 67650328158 scopus 로고
    • An Introduction to Kolmogorov Complexity and Its Applications
    • Li, M. and Vitânyi, P. (1993) An Introduction to Kolmogorov Complexity and Its Applications. Springer, New York.
    • (1993) Springer, New York.
    • Li, M.1    Vitânyi, P.2
  • 10
    • 0029777083 scopus 로고    scopus 로고
    • Fisher information and stochastic complexity
    • Rissanen, J. (1996) Fisher information and stochastic complexity. IEEE Trans. Information Theory, IT-42, 40-47.
    • (1996) IEEE Trans. Information Theory , vol.IT-42 , pp. 40-47
    • Rissanen, J.1
  • 13
    • 33745809002 scopus 로고    scopus 로고
    • The MDL principle in modeling and coding
    • To commemorate 50 years of information theory.
    • Ban-on, A. R., Rissanen, J. and Yu, B. (1998) The MDL principle in modeling and coding. Special issue of IEEE Trans. Information Theory, IT-44, 2743-2760. To commemorate 50 years of information theory.
    • (1998) Special Issue of IEEE Trans. Information Theory , vol.IT-44 , pp. 2743-2760
    • Ban-on, A.R.1    Rissanen, J.2    Yu, B.3
  • 14
    • 33745868889 scopus 로고    scopus 로고
    • MDL Estimation for Small Sample Sizes and its Application to Linear Regression
    • Dom, B. (1996) MDL Estimation for Small Sample Sizes and its Application to Linear Regression. IBM Research Report RJ 10030, June 13.
    • (1996) IBM Research Report RJ 10030, June 13.
    • Dom, B.1
  • 15
    • 33745872389 scopus 로고    scopus 로고
    • MDL denoising. http://www.cs.tut.fi/~rissanen/ submitted to
    • Rissanen, J. (1999) MDL denoising. http://www.cs.tut.fi/~rissanen/ (submitted to IEEE Trans. Information Theory)
    • (1999) IEEE Trans. Information Theory
    • Rissanen, J.1
  • 16
    • 0025430804 scopus 로고
    • Information-theoretic asymptotics of Bayes methods
    • Clarke, B. S. and Barren, A. R. (1990) Information-theoretic asymptotics of Bayes methods. IEEE Trans. Information Theory, IT-36, 453-471.
    • (1990) IEEE Trans. Information Theory , vol.IT-36 , pp. 453-471
    • Clarke, B.S.1    Barren, A.R.2
  • 17
    • 0029304928 scopus 로고
    • A strong version of the redundancy-capacity theorem of universal coding
    • Merhav, N. and Feder, M. (1995) A strong version of the redundancy-capacity theorem of universal coding. IEEE Trans. Information Theory, IT-41, 714-722.
    • (1995) IEEE Trans. Information Theory , vol.IT-41 , pp. 714-722
    • Merhav, N.1    Feder, M.2


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