메뉴 건너뛰기




Volumn 44, Issue 2, 1998, Pages 782-786

Some notes on Rissanen's stochastic complexity

Author keywords

Fisher information; Model selection; Robust regression; Stochastic complexity; Two part codes

Indexed keywords

APPROXIMATION THEORY; CODES (SYMBOLS); DATA COMPRESSION; EIGENVALUES AND EIGENFUNCTIONS; ENCODING (SYMBOLS); MATHEMATICAL MODELS; OPTIMIZATION; RANDOM PROCESSES; REGRESSION ANALYSIS;

EID: 0032026464     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.661521     Document Type: Article
Times cited : (24)

References (11)
  • 1
    • 0002187292 scopus 로고
    • An almost optimal algorithm for unbounded searching
    • J. L. Bentley and A. C. Yao, "An almost optimal algorithm for unbounded searching," Inform. Processing Lett., vol. 5, pp. 82-87, 1976.
    • (1976) Inform. Processing Lett. , vol.5 , pp. 82-87
    • Bentley, J.L.1    Yao, A.C.2
  • 2
    • 0016486577 scopus 로고
    • Universal codeword sets and representations of the integers
    • P. Elias, "Universal codeword sets and representations of the integers," IEEE Trans. Inform. Theory, vol. IT-21, pp. 194-203, 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 194-203
    • Elias, P.1
  • 3
    • 0000666757 scopus 로고
    • On stochastic complexity and nonparametric density estimation
    • P. Hall and E. J. Hannan, "On stochastic complexity and nonparametric density estimation," Biometrika, vol. 75, pp. 705-714, 1988.
    • (1988) Biometrika , vol.75 , pp. 705-714
    • Hall, P.1    Hannan, E.J.2
  • 5
    • 0003157339 scopus 로고
    • Robust estimation of a location parameter
    • P. J. Huber, "Robust estimation of a location parameter," Ann. Math. Statist., vol. 35, pp. 73-101, 1964.
    • (1964) Ann. Math. Statist. , vol.35 , pp. 73-101
    • Huber, P.J.1
  • 6
    • 0017971977 scopus 로고
    • Some equivalences between Shannon entropy and Kolmogorov complexity
    • S. K. Leung-Yan-Cheong and T. Cover, "Some equivalences between Shannon entropy and Kolmogorov complexity," IEEE Trans. Inform. Theory, vol. IT-24, pp. 331-338, 1978.
    • (1978) IEEE Trans. Inform. Theory , vol.IT-24 , pp. 331-338
    • Leung-Yan-Cheong, S.K.1    Cover, T.2
  • 7
    • 0040323443 scopus 로고    scopus 로고
    • On model selection in robust linear regression
    • Seminar für Statistik, ETH Zürich
    • G. Qian and H. R. Künsch, "On model selection in robust linear regression," Res. Rep. 80, Seminar für Statistik, ETH Zürich, 1996.
    • (1996) Res. Rep. , vol.80
    • Qian, G.1    Künsch, H.R.2
  • 8
    • 0001098776 scopus 로고
    • A universal prior for integers and estimation by minimum description length
    • J. Rissanen, "A universal prior for integers and estimation by minimum description length," Ann. Statist., vol. 11, pp. 416-431, 1983.
    • (1983) Ann. Statist. , vol.11 , pp. 416-431
    • Rissanen, J.1
  • 10
    • 0029777083 scopus 로고    scopus 로고
    • Fisher information and stochastic complexity
    • _, "Fisher information and stochastic complexity," IEEE Trans. Inform. Theory, vol. 42, pp. 40-47, 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 40-47
  • 11
    • 0347351335 scopus 로고
    • Data compression and histograms
    • B. Yu and T. Speed, "Data compression and histograms," Probab. Theory Related Fields, vol. 92, pp. 195-229, 1992.
    • (1992) Probab. Theory Related Fields , vol.92 , pp. 195-229
    • Yu, B.1    Speed, T.2


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