Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Minimum message length
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Formal information theory restatement of Occam's Razor}} '''Minimum message length''' ('''MML''') is a Bayesian information-theoretic method for statistical model comparison and selection.<ref>{{Cite book|title=Statistical and inductive inference by minimum message length|last=Wallace, C. S. (Christopher S.), -2004.|date=2005|publisher=Springer|isbn=9780387237954|location=New York|oclc=62889003}}</ref> It provides a formal [[information theory]] restatement of [[Occam's Razor]]: even when models are equal in their measure of fit-accuracy to the observed data, the one generating the most concise ''explanation'' of data is more likely to be correct (where the ''explanation'' consists of the statement of the model, followed by the [[Lossless compression|lossless encoding]] of the data using the stated model). MML was invented by [[Chris Wallace (computer scientist)|Chris Wallace]], first appearing in the seminal paper "An information measure for classification".<ref>{{Cite journal|last1=Wallace|first1=C. S.|last2=Boulton|first2=D. M.|date=1968-08-01|title=An Information Measure for Classification|journal=The Computer Journal|language=en|volume=11|issue=2|pages=185β194|doi=10.1093/comjnl/11.2.185|issn=0010-4620|doi-access=free}}</ref> MML is intended not just as a theoretical construct, but as a technique that may be deployed in practice.<ref>{{Cite book|title=Coding Ockham's Razor.|last=Allison, Lloyd.|date=2019|publisher=Springer|isbn=978-3030094881|oclc=1083131091}}</ref> It differs from the related concept of [[Kolmogorov complexity]] in that it does not require use of a [[Turing completeness|Turing-complete]] language to model data.<ref name=":0">{{Cite journal|last1=Wallace|first1=C. S.|last2=Dowe|first2=D. L.|date=1999-01-01|title=Minimum Message Length and Kolmogorov Complexity|url=https://academic.oup.com/comjnl/article/42/4/270/558949|journal=The Computer Journal|language=en|volume=42|issue=4|pages=270β283|doi=10.1093/comjnl/42.4.270|issn=0010-4620|url-access=subscription}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)