Cited by 459Data Mining Algorithms and ApplicationsMachine Learning and Data ClassificationData Mining and Machine Learning Applications

The Role of Occam's Razor in Knowledge Discovery

Domingos, Pedro·1999·Data Mining and Knowledge Discovery

Integrity signals

Registry

Crossref · 10.1023/a:1009868929893

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The most common interpretation of an Occamist bias is that amongst all hypotheses consistent with the data, the simplest is the most likely.

    “The most common interpretation of an Occamist bias is that amongst all hypotheses consistent with the data, the simplest is the most likely 28 .”

    From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Domingos (1999)

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Domingos, P.
Affiliations
University of Washington (US)
Corresponding author
Domingos, Pedro
Venue
Data Mining and Knowledge Discovery
Published
1999-12
Volume
3
Issue
4
Pages
409-425
ISSN
  • 1384-5810 (ISSN-L)
  • 1573-756X
OpenAlex
W1761022139
Cited by
459
References
5
Citations by year
2026: 26 · 2025: 35 · 2024: 29 · 2023: 15 · 2022: 20 · 2021: 22 · 2020: 21 · 2019: 22 · 2018: 19 · 2017: 21 · 2016: 11 · 2015: 11 · 2014: 10 · 2013: 10 · 2012: 21
FWCI
22.46
Type
journal article
Language
en
Open access
closed
Locations
Data Mining and Knowledge Discovery (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
Keywords
Occam's razor, knowledge discovery, model simplicity, overfitting, domain constraints, model selection, model comprehensibility

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