Induction of Decision Trees.

Quinlan, J. R. (1986). Induction of Decision Trees. Machine Learning, 1(1), 81-106.

Type

Journal article

Intellectual base

Primary research

Year

1986

DOI

10.1007/bf00116251

Link

https://doi.org/10.1007/BF00116251

Cited from

computer_science, information_theory

Cited by

2 citations across 2 artifacts.

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

Primes

• Conditional Entropy
  • Quinlan's ID3 work made this reduction criterion central to a reusable tree-induction procedure.
• Greedy Algorithm
  • In machine learning it is greedy decision-tree induction, greedy feature selection, and greedy sequence decoding versus beam search.

    This sourceDescribes the ID3 algorithm, which greedily splits on the locally information-gain-maximizing attribute at each node with no lookahead — a canonical greedy-induction procedure contrasted with lookahead methods (cf. beam search in sequence decoding).

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:0576841205d5 · see in the full table