The DOI matches its Crossref record.
A universal finite memory source
Abstract
An irreducible parameterization for a finite memory source is constructed in the form of a tree machine. A universal information source for the set of finite memory sources is constructed by a predictive modification of an earlier studied algorithm-Context. It is shown that this universal source incorporates any minimal data-generating tree machine in an asymptotically optimal manner in the following sense: the negative logarithm of the probability it assigns to any long typical sequence, generated by any tree machine, approaches that assigned by the tree machine at the best possible rate.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS
Weinberger, M. J., Seroussi, G., & Sapiro, G. (2000) · IEEE Transactions on Image Processing · doi:10.1109/83.855427 · Cited by 1,638
Self-citationThe minimum description length principle in coding and modeling
Barron, A., Rissanen, J., & Yu, B. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720554 · Cited by 1,019
Self-citationThe context-tree weighting method: basic properties
Willems, F. M. J., Shtarkov, Y. M., & Tjalkens, T. J. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382012 · Cited by 919
Fisher information and stochastic complexity
Rissanen, J. J. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481776 · Cited by 814
Self-citationMerhav, N., & Feder, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720534 · Cited by 438
Self-citationBühlmann, P., & Wyner, A. J. (1999) · The Annals of Statistics · doi:10.1214/aos/1018031204 · Cited by 394
Entropy estimation of symbol sequences
Schürmann, T., & Grassberger, P. (1996) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.166191 · Cited by 319
LeZi-update: an information-theoretic approach to track mobile users in PCS networks
Bhattacharya, A., & Das, S. K. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313457 · Cited by 307
Pessach, D., Singer, G., Avrahami, D., Chalutz Ben-Gal, H., Shmueli, E., & Ben-Gal, I. (2020) · Decision Support Systems · doi:10.1016/j.dss.2020.113290 · Cited by 304
“where C is a pruning constant tuned to the considered process requirements (with default of C= 2 as suggested in [60]).”
MethodLeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks
Bhattacharya, A., & Das, S. K. (2002) · Wireless Networks · doi:10.1023/a:1013759724438 · Cited by 205
Investigating purchasing-sequence patterns for financial services using Markov, MTD and MTDg models
Prinzie, A., & Van den Poel, D. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.05.004 · Cited by 75
Metadata
- Authors
- Weinberger, M. J., Rissanen, J. J., & Feder, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1995-05
- Volume
- 41
- Issue
- 3
- Pages
- 643-652
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2095963120
- Cited by
- 228
- References
- 0
- FWCI
- 12.45
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.