Cited by 2,553Data Mining Algorithms and ApplicationsRough Sets and Fuzzy LogicExplainable Artificial Intelligence (XAI)

Simplifying decision trees

Open access
Quinlan, J.R.·1987·International Journal of Man-Machine Studies

Integrity signals

Registry

Crossref · 10.1016/s0020-7373(87)80053-6

Cites

12 of 12 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?

  • Another DT algorithm, REPTree, was introduced for classification and aimed at building faster and simpler tree models using information gain for splitting, along with reduced-error pruning.

    “Another DT algorithm, under the name of Reduced Error Pruning Tree (REPTree), was also introduced for classification.REPTree aimed at building faster and simpler tree models using information gain for splitting, along with reduced-error pruning [374].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Quinlan, J. R.
Affiliations
Massachusetts Institute of Technology (US)
Corresponding author
Quinlan, J.R.
Venue
International Journal of Man-Machine Studies
Publisher
Elsevier BV
Published
1987-09
Volume
27
Issue
3
Pages
221-234
ISSN
0020-7373 (ISSN-L)
OpenAlex
W2128420091
Cited by
2,553
References
12
Citations by year
2026: 36 · 2025: 84 · 2024: 109 · 2023: 124 · 2022: 143 · 2021: 149 · 2020: 146 · 2019: 119 · 2018: 123 · 2017: 127 · 2016: 83 · 2015: 77 · 2014: 77 · 2013: 74 · 2012: 62
FWCI
77.10
Type
journal article
Language
en
Open access
Locations
  • International Journal of Man-Machine Studies (publishedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
Topics
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Rough Sets and Fuzzy Logic
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
Keywords
decision tree, tree pruning, knowledge representation, interpretability, inductive learning, model complexity

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