The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Statistical and Inductive Inference by Minimum Message Length
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Information Theory and an Extension of the Maximum Likelihood Principle
Akaike, H. (1998) · Springer Series in Statistics · doi:10.1007/978-1-4612-1694-0_15 · Cited by 17,781
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (2019) · Texts in Computer Science · doi:10.1007/978-3-030-11298-1 · Cited by 3,681
Arithmetic coding for data compression
Witten, I. H., Neal, R. M., & Cleary, J. G. (1987) · Communications of the ACM · doi:10.1145/214762.214771 · Cited by 2,877
Three approaches to the quantitative definition of information*
Kolmogorov, A. N. (1968) · International Journal of Computer Mathematics · doi:10.1080/00207166808803030 · Cited by 2,031
A formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758
A Universal Prior for Integers and Estimation by Minimum Description Length
Rissanen, J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346150 · Cited by 1,672
An Information Measure for Classification
Wallace, C. S., & Boulton, D. M. (1968) · The Computer Journal · doi:10.1093/comjnl/11.2.185 · Cited by 933
Some Contributions to Maximum Likelihood Factor Analysis
Jöreskog, K. G. (1967) · Psychometrika · doi:10.1007/bf02289658 · Cited by 870
A Theory of Program Size Formally Identical to Information Theory
Chaitin, G. J. (1975) · Journal of the ACM · doi:10.1145/321892.321894 · Cited by 849
Rissanen, J., & Langdon, G. G. (1979) · IBM Journal of Research and Development · doi:10.1147/rd.232.0149 · Cited by 751
Inferring decision trees using the minimum description lenght principle
Ross Quinlan, J., & Rivest, R. L. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90010-2 · Cited by 652
Asymptotic quantization error of continuous signals and the quantization dimension
Zador, P. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056490 · Cited by 530
Estimation and Inference by Compact Coding
Wallace, C. S., & Freeman, P. R. (1987) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1987.tb01695.x · Cited by 523
Minimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
The Logical Structure of the World and Pseudoproblems in Philosophy
Carnap, R. (1967) · University of California Press eBooks · Cited by 408
Time's Arrow and Archimedes’ Point
Price, H., & Lebowitz, J. (1997) · Physics Today · doi:10.1063/1.881657 · Cited by 267
BHANSALI, R. J., & DOWNHAM, D. Y. (1977) · Biometrika · doi:10.1093/biomet/64.3.547 · Cited by 205
Wallace, C. S., & Patrick, J. D. (1993) · Machine Learning · doi:10.1023/a:1022646101185 · Cited by 200
An experimental and theoretical comparison of model selection methods
Kearns, M., Mansour, Y., Ng, A. Y., & Ron, D. (1995) · Proceedings of the eighth annual conference on Computational learning theory - COLT '95 · doi:10.1145/225298.225301 · Cited by 167
MML clustering of multi-state, Poisson, von Mises circular and Gaussian distributions
Wallace, C. S., & Dowe, D. L. (2000) · Statistics and Computing · doi:10.1023/a:1008992619036 · Cited by 167
Hypothesis Selection and Testing by the MDL Principle
Rissanen, J. (1999) · The Computer Journal · doi:10.1093/comjnl/42.4.260 · Cited by 159
On Model Selection and the ARC Sine Laws
Woodroofe, M. B. (1982) · The Annals of Statistics · doi:10.1214/aos/1176345983 · Cited by 102
On the Voronoi Regions of Certain Lattices
Conway, J. H., & Sloane, N. J. A. (1984) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0605031 · Cited by 92
The Minimum Description Length Principle and Reasoning under Uncertainty
Grünwald, P. (1998) · Cited by 81
A Statistical Examination of the Megalithic Sites in Britain
Thom, A. S. (1955) · Journal of the Royal Statistical Society Series A (General) · doi:10.2307/2342494 · Cited by 73
Learning Linear Causal Models by MML Sampling
Wallace, C. S., & Korb, K. B. (1999) · Springer eBooks · doi:10.1007/978-3-642-58648-4_7 · Cited by 58
New Error Bounds for Solomonoff Prediction
Hütter, M. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1743 · Cited by 31
MML estimation of the parameters of the spherical fisher distribution
Dowe, D. L., Oliver, J., & Wallace, C. S. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61863-5_48 · Cited by 26
Two Kinds of Probabilistic Induction
Solomonoff, R. J. (1999) · The Computer Journal · doi:10.1093/comjnl/42.4.256 · Cited by 26
Finding Outpoints in Noisy Binary Sequences — A Revised Empirical Evaluation
Viswanathan, M., Wallace, C. S., Dowe, D. L., & Korb, K. B. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46695-9_34 · Cited by 19
Rumantir, G. W., & Wallace, C. S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45231-7_45 · Cited by 4
(1967)
Cited by
Universal intelligence: a definition of machine intelligence
Legg, S., & Hutter, M. (2007) · Minds and Machines · doi:10.1007/s11023-007-9079-x · Cited by 803
Krimp: mining itemsets that compress
Vreeken, J., van Leeuwen, M., & Siebes, A. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0202-x · Cited by 300
Knowledge acquisition with forgetting: an incremental and developmental setting
Martínez-Plumed, F., Ferri, C., Hernández-Orallo, J., & Ramírez-Quintana, M. J. (2015) · Adaptive Behavior · doi:10.1177/1059712315608675 · Cited by 14
“…theory or hypothesis is considered as a whole and separated from the evidence, we have many well-founded proposals, such as the minimum message length (MML) principle (Wallace, 2005; Wallace & Boulton, 1968) or the similar (but posterior) minimum description length (MDL) principle (Rissanen, 1999).”
BackgroundMethod
Metadata
- Venue
- Information Science and Statistics
- Publisher
- Springer-Verlag
- Published
- 2005
- OpenAlex
- W1534506107
- Cited by
- 349
- References
- 34
- FWCI
- 4.92
- Type
- book
- 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.