메뉴 건너뛰기




Volumn 61, Issue 3, 2000, Pages 2563-2568

Testing for general dynamical stationarity with a symbolic data compression technique

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMICAL SYSTEMS;

EID: 0000281130     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.61.2563     Document Type: Article
Times cited : (20)

References (25)
  • 5
    • 0040973114 scopus 로고    scopus 로고
    • The most common application has been for entropy estimation, usually via string matching methods inspired by Lempel-Ziv compression. A context method similar to the present one was presented in T. Schurmann and P. Grassberger, Chaos 6, 414 (1996).
    • (1996) Chaos , vol.6 , pp. 414
    • Schurmann, T.1    Grassberger, P.2
  • 15
    • 0013053127 scopus 로고    scopus 로고
    • Although the Krischevsky-Trofimov (KT) estimator has nice analytically computable asymptotic properties, other estimators may be superior for finite length observed data. We explored a number of ansatzes used by the text compression community but none were consistently superior to the KT estimator with a variable “ballast” (Formula presented) optimization parameter: (Formula presented). Often (Formula presented) gave results close to the minimum code length
    • Y. M. Shtarkov, T. J. Tjalkens, and F. M. J. Willems, Probl. Inf. Transm. 33, 17 (1997). Although the Krischevsky-Trofimov (KT) estimator has nice analytically computable asymptotic properties, other estimators may be superior for finite length observed data. We explored a number of ansatzes used by the text compression community but none were consistently superior to the KT estimator with a variable “ballast” (Formula presented) optimization parameter: (Formula presented). Often (Formula presented) gave results close to the minimum code length.
    • (1997) Probl. Inf. Transm. , vol.33 , pp. 17
    • Shtarkov, Y.M.1    Tjalkens, T.J.2    Willems, F.M.J.3
  • 16
    • 85036268325 scopus 로고    scopus 로고
    • Physica D (to be published)
    • K. Judd and A. I. Mees, Physica D (to be published).
    • Judd, K.1    Mees, A.I.2
  • 17
    • 85036419007 scopus 로고    scopus 로고
    • The (Formula presented) analytics degrade for small bin counts. For those bins, we merge any symbols whose expected count—for either set one or two—is less than five, reducing the degrees of freedom appropriately. If, after merging, there remain fewer than two symbols passing this criterion, then this node is wholly excluded
    • The (Formula presented) analytics degrade for small bin counts. For those bins, we merge any symbols whose expected count—for either set one or two—is less than five, reducing the degrees of freedom appropriately. If, after merging, there remain fewer than two symbols passing this criterion, then this node is wholly excluded.
  • 18
    • 85036179396 scopus 로고    scopus 로고
    • this discrete case, the sum will encounter tables exactly as likely as the observed one (such as the observed table itself); the summed (Formula presented) for these tables is weighted by a uniform random deviate (Formula presented)
    • In this discrete case, the sum will encounter tables exactly as likely as the observed one (such as the observed table itself); the summed (Formula presented) for these tables is weighted by a uniform random deviate (Formula presented).
  • 19
    • 84977728137 scopus 로고
    • The model is (Formula presented) (Formula presented) (Formula presented) Each set was 5000 points long sampled every (Formula presented)
    • E. N. Lorenz, Tellus, Ser. A 36, 98 (1984). The model is (Formula presented) (Formula presented) (Formula presented) Each set was 5000 points long sampled every (Formula presented).
    • (1984) Tellus, Ser. A , vol.36 , pp. 98
    • Lorenz, E.N.1
  • 25
    • 85036219461 scopus 로고    scopus 로고
    • Unfortunately the state-selecting context methods that are amenable to rigorous proof of universality are slightly different from those that are most practical to implement and have the best performance, though most of the time the differences are small
    • Unfortunately the state-selecting context methods that are amenable to rigorous proof of universality are slightly different from those that are most practical to implement and have the best performance, though most of the time the differences are small.


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