메뉴 건너뛰기




Volumn 304, Issue 1-3, 2003, Pages 431-441

Fractal dimension and logarithmic loss unpredictability

Author keywords

[No Author keywords available]

Indexed keywords

FRACTALS; GEOMETRY; NUMERICAL ANALYSIS;

EID: 0037811185     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00138-5     Document Type: Article
Times cited : (35)

References (14)
  • 1
    • 0010324814 scopus 로고
    • Universal gambling schemes and the complexity measures of Kolmogorov and Chaitin
    • Stanford University Department of Statistics, October
    • T. Cover, Universal gambling schemes and the complexity measures of Kolmogorov and Chaitin, Tech. Report 12, Stanford University Department of Statistics, October 1974.
    • (1974) Tech. Report , vol.12
    • Cover, T.1
  • 4
    • 0026222802 scopus 로고
    • Gambling using a finite state machine
    • Feder M. Gambling using a finite state machine. IEEE Trans. Inform. Theory. 37:1991;1459-1461.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 1459-1461
    • Feder, M.1
  • 7
    • 34250950477 scopus 로고
    • Dimension und äusseres mass
    • Hausdorff F. Dimension und äusseres mass. Mathematische Annalen. 79:1919;157-179.
    • (1919) Mathematische Annalen , vol.79 , pp. 157-179
    • Hausdorff, F.1
  • 8
    • 0345227319 scopus 로고    scopus 로고
    • Dimension in complexity classes
    • to appear
    • J.H. Lutz, Dimension in complexity classes, SIAM J. Comput., to appear.
    • SIAM J. Comput.
    • Lutz, J.H.1
  • 10
    • 0004018518 scopus 로고
    • Algorithmic approach to the prediction problem
    • Ryabko B.Ya. Algorithmic approach to the prediction problem. Problems Inform. Transmission. 29:1993;186-193.
    • (1993) Problems Inform. Transmission , vol.29 , pp. 186-193
    • Ryabko, B.Ya.1
  • 11
    • 0000797906 scopus 로고
    • The complexity and effectiveness of prediction problems
    • Ryabko B.Ya. The complexity and effectiveness of prediction problems. J. Complexity. 10:1994;281-295.
    • (1994) J. Complexity , vol.10 , pp. 281-295
    • Ryabko, B.Ya.1
  • 12
    • 26544456649 scopus 로고    scopus 로고
    • The nonprobabilistic approach to learning the best prediction
    • Electronic Colloquium on Computational Complexity
    • B. Ryabko, The nonprobabilistic approach to learning the best prediction, Tech. Report TR02-011, Electronic Colloquium on Computational Complexity, 2002.
    • (2002) Tech. Report , vol.TR02-011
    • Ryabko, B.1
  • 13
    • 0015474970 scopus 로고
    • Endliche automaten und zufallsfolgen
    • Schnorr C.P., Stimm H. Endliche automaten und zufallsfolgen. Acta Informatica. 1:1972;345-359.
    • (1972) Acta Informatica , vol.1 , pp. 345-359
    • Schnorr, C.P.1    Stimm, H.2
  • 14
    • 0038856793 scopus 로고    scopus 로고
    • A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
    • Staiger L. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Comput. Systems. 31:1998;215-229.
    • (1998) Theory of Comput. Systems , vol.31 , pp. 215-229
    • Staiger, L.1


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