The Complexity of Strict Minimum Message Length Inference

DOI10.1093/COMJNL/45.3.285MaRDI QIDQ4551652zbMATH OpenOpenAlexFDO

Authors Chris Wallace, Graham Farr

Publication date 6 October 2002

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/45.3.285

zbMATH Keywords

strict minimum message length

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 2188025
• A linear-time algorithm for computing the multinomial stochastic complexity
• Minimum Message Length and Kolmogorov Complexity
• On the complexity of inductive inference
• Minimum message length estimation using EM methods: a case study

Cited in

(5)

• Minimum message length estimation using EM methods: a case study
• Minimum message length shrinkage estimation
• Minimum message length inference of the Poisson and geometric models using heavy-tailed prior distributions
• Minimum message length encoding and the comparison of macromolecules
• Minimal inference problem over finite domains: the landscape of complexity

This page was built for publication: The Complexity of Strict Minimum Message Length Inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551652)