메뉴 건너뛰기




Volumn 42, Issue 1, 1996, Pages 272-275

Lower bounds on expected redundancy for nonparametric classes

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CHANNEL CAPACITY; CODES (SYMBOLS); DATA COMPRESSION; MATHEMATICAL MODELS; REDUNDANCY; THEOREM PROVING;

EID: 0029779159     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.481802     Document Type: Article
Times cited : (4)

References (13)
  • 1
    • 0025430804 scopus 로고
    • Information-theoretic asymptotics of Bayes methods
    • May
    • B. S. Clarke and A. R. Barron, "Information-theoretic asymptotics of Bayes methods," IEEE Trans. Inform. Theory, vol. 36, pp. 453-471, May 1990.
    • (1990) IEEE Trans. Inform. Theory , vol.36 , pp. 453-471
    • Clarke, B.S.1    Barron, A.R.2
  • 3
    • 0015681549 scopus 로고
    • Universal noiseless coding
    • Nov.
    • L. Davisson, "Universal noiseless coding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-795, Nov. 1973.
    • (1973) IEEE Trans. Inform. Theory , vol.IT-19 , pp. 783-795
    • Davisson, L.1
  • 8
    • 0039894859 scopus 로고
    • On the information in a sample about a parameter
    • B. N. Petrov and F. Csáki, Eds. Budapest, Hungary: Akademiai Kiado
    • I. A. Ibragimov and R. Z. Has'minsky, "On the information in a sample about a parameter," in Proc. 2nd Int. Symp. on Information Theory, B. N. Petrov and F. Csáki, Eds. Budapest, Hungary: Akademiai Kiado, 1973.
    • (1973) Proc. 2nd Int. Symp. on Information Theory
    • Ibragimov, I.A.1    Has'minsky, R.Z.2
  • 9
    • 0029304928 scopus 로고
    • A strong version of the redundancy-capacity theorem of universal coding
    • May
    • N. Merhav and M. Feder, "A strong version of the redundancy-capacity theorem of universal coding," IEEE Trans. Inform. Theory, vol. 41, pp. 714-722, May 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 714-722
    • Merhav, N.1    Feder, M.2
  • 10
    • 0000318553 scopus 로고
    • Stochastic complexity and modeling
    • J. Rissanen, "Stochastic complexity and modeling," Annals Statist., vol. 14, pp. 1080-1100, 1986.
    • (1986) Annals Statist. , vol.14 , pp. 1080-1100
    • Rissanen, J.1
  • 11
    • 0026838784 scopus 로고
    • Density estimation by stochastic complexity
    • May
    • J. Rissanen, T. Speed, and B. Yu, "Density estimation by stochastic complexity," IEEE Trans. Inform. Theory, vol. 38, pp. 315-323, May 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.38 , pp. 315-323
    • Rissanen, J.1    Speed, T.2    Yu, B.3
  • 13
    • 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가 분석하여 추출한 것입니다.