Induction of Decision Trees.¶
Quinlan, J. R. (1986). Induction of Decision Trees. Machine Learning, 1(1), 81-106.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Conditional Entropy
- 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).
- In machine learning it is greedy decision-tree induction, greedy feature selection, and greedy sequence decoding versus beam search.
Domain-specific¶
- Information Gain for Decision-Tree Splits
- Quinlan's ID3 account defines this weighted expected reduction and uses it as a greedy tree-induction heuristic.
This sourceThe weather example is worked in detail; the chess study is reported without per-node gain tables.
- Quinlan's ID3 account defines this weighted expected reduction and uses it as a greedy tree-induction heuristic.
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 3 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.
Registry ID ref:0576841205d5 · see in the full table