Modeling by Shortest Data Description

Rissanen, J. (1978). Modeling by Shortest Data Description. Automatica, 14(5), 465-471.

Type

Journal article

Intellectual base

Primary research

Year

1978

Volume

14

Issue

5

Pages

465-471

ISSN

0005-1098

DOI

10.1016/0005-1098(78)90005-5

DOI registrant

Elsevier

Link

https://doi.org/10.1016/0005-1098(78)90005-5

Cited from

computer_science, information_theory, philosophy

Cited by

4 citations across 4 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Compression
  • Every compression articulation specifies (1) the source model — what is being compressed (text, image, audio, video, scientific data, code)

    This sourceIntroduces the Minimum Description Length (MDL) principle: choose the model minimizing the total description length of model + data. SUPPORTS marker 169 only loosely — the marker sits on '(1) the source model — what is being compressed (text, image, audio, ... code)', and MDL concerns model selection by code length rather than enumerating data types; it underwrites the source-modeling idea but not the specific list. DOI verified. See flag.

• Parsimony (Occam's Razor)
  • … necessity) codified the maxim and supplied the foundational name; modern formalizations ground parsimony in Bayesian model comparison (marginal likelihood penalizes complexity automatically), information-theoretic criteria (Akaike Information Criterion, Bayesian Information Criterion), Minimum Description Length

    This sourceRissanen Minimum Description Length principle.

• Template Instantiation
  • The description shrinks from instance count times property count down to the frame's properties plus what each occasion actually supplied, and the shrinkage is exact rather than approximate because the frame's invariance guarantees nothing has been lost in the compression.

Mechanisms

• Minimum Description Length Penalty
  • The decision is made by a principled measure rather than by chasing a fit statistic upward until the model overfits.

    This sourceSelects models by minimizing total description length, balancing fit against model complexity rather than optimizing fit alone.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 4 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://www.sciencedirect.com/science/article/abs/pii/0005109878900055 ×1

Registry ID ref:985890406335 · see in the full table