Cited by 21,439Data Mining Algorithms and ApplicationsData Mining and Machine Learning ApplicationsMachine Learning and Data Classification

Induction of decision trees

Open access
Quinlan, J. R.·1986·Machine Learning

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/bf00116251

Cites

33 of 33 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • It is impossible to provide a decision tree learner this infinite relation because it would require an infinite feature table.

    “For instance, it is impossible to provide a decision tree learner (Quinlan, 1986, 1993) this infinite relation because it would require an infinite feature table.”

    From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Quinlan, 1986

  • Quinlan's (1990) FOIL system is one of the most well-known ILP systems and is a natural extension of ID3 from the propositional setting to the first-order setting.

    “Quinlan's (1990) FOIL system is one of the most well-known ILP systems and is a natural extension of ID3 (Quinlan, 1986) from the propositional setting to the first-order setting.”

    From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Quinlan, 1986

  • TILDE extends a decision tree learner to the first-order setting and uses the same information gain methods to induce hypotheses.

    “For instance, TILDE extends a decision tree learner (Quinlan, 1986, 1993) to the first-order setting and uses the same information gain methods to induce hypotheses.”

    From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Quinlan, 1986

  • Fault tolerance and resilience are crucial in real-time monitoring to promptly detect failures and recover to minimize data loss and downtime.

    “Fault tolerance and resilience are crucial in real-time monitoring to promptly detect failures and recover to minimize data loss and downtime [7].”

    From Real-Time Monitoring of Data Pipelines: Exploring and Experimentally Proving that the Continuous Monitoring in Data Pipelines Reduces Cost and Elevates Quality (2024) · cites this paper as [7]

    The Noise section (pp. 12–16) and Unknown attribute values section (p. 19) discuss how decision trees handle corrupted or missing data. Searches for real-time monitoring, failure detection, recovery, data loss, and downtime found no passage addressing the attributed claim. (LLM, conf=0.76)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

5 of the 38 references couldn’t be matched to a known paper.

Research works printed but not linked: 13

  1. Catlett, J. (1985). Induction using the shafer representation (Technical report). Basser Department of Computer Science, University of Sydney, Australia.
  2. Dechter, R., & Michie, D. (1985). Structured induction of plans and programs (Technical report). IBM Scientific Center, Los Angeles, CA.
  3. Feigenbaum, E.A. (1981). Expert systems in the 1980s. In A. Bond (Ed.), State of the art report on machine intelligence. Maidenhead: Pergamon-Infotech.
  4. Hart, A.E. (1985). Experience in the use of an inductive system in knowledge engineering. In M.A. Bramer (Ed.), Research and development in expert systems. Cambridge University Press.
  5. Kononenko, I., Bratko, I., & Roskar, E. (1984). Experiments in automatic learning of medical diagnostic rules (Technical report). Jozef Stefan Institute, Ljubljana, Yugoslavia.
  6. Michie, D. (1983). Inductive rule generation in the context of the Fifth Generation. Proceedings of the Second International Machine Learning Workshop. University of Illinois at Urbana-Champaign.
  7. Nilsson, N.J. (1965). Learning machines, New York: McGraw-Hill.
  8. Patterson, A., & Niblett, T. (1983). ACLS user manual. Glasgow: Intelligent Terminals Ltd.
  9. Pearl, J. (1978a). Entropy, information and rational decisions (Technical report). Cognitive Systems Laboratory, University of California, Los Angeles.
  10. Quinlan, J.R. (1979). Discovering rules by induction from large collections of examples. In D. Michie (Ed.), Expert systems in the micro electronic age. Edinburgh University Press.
  11. Quinlan, J.R. (1982). Semi-autonomous acquisition of pattern-based knowledge. In J.E. Hayes, D. Michie & Y-H. Pao (Eds.), Machine intelligence 10. Chichester: Ellis Horwood.
  12. Quinlan, J.R. (1983b). Learning from noisy data, Proceedings of the Second International Machine Learning Workshop. University of Illinois at Urbana-Champaign.
  13. Quinlan, J.R. (1985a). The effect of noise on concept learning. In R.S. Michalski, J.G. Carbonell & T.M. Mitchell (Eds.), Machine learning. Los Altos: Morgan Kaufmann (in press).

Cited by

Sorted by citations

Authors
Quinlan, J. R.
Corresponding author
Quinlan, J. R.
Venue
Machine Learning
Published
1986-03
Volume
1
Issue
1
Pages
81-106
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W2149706766
Cited by
21,439
References
38
Citations by year
2026: 899 · 2025: 1399 · 2024: 1161 · 2023: 1085 · 2022: 969 · 2021: 1165 · 2020: 1141 · 2019: 1064 · 2018: 877 · 2017: 801 · 2016: 700 · 2015: 633 · 2014: 687 · 2013: 680 · 2012: 681
FWCI
255.45
Type
journal article
Language
en
Open access
Locations
Machine Learning (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
decision tree induction, ID3, expert systems, noisy data, missing data, feature selection, classification

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