Induction On Trees is a formal proof technique in mathematical logic and theoretical computer science that generalizes mathematical induction to recursively defined tree structures by establishing a base case for leaf nodes and an inductive step for internal nodes based on their subtrees.
72
Publications
34.2K
Citations
134
Authors
65
Institutions
Publications per year
2017–2026
5
Parents
Publications
72
J. R. Quinlan · Machine Learning · 1986 · 14.8K citations · Full text
J. R. Quinlan · Machine Learning · 1986 · 12.4K citations · Full text
Quinlan · 2003 · 999 citations
Incremental Induction of Decision Trees
Paul E. Utgoff · Machine Learning · 1989 · 796 citations · Full text
Induction of decision trees. Machine Learning
J. R. Quinlan · Symposium on the Theory of Computing · 1986 · 785 citations
1–5 of 72
Authors
134
- WB
3
h-index
- JR
3
h-index
- HB
2
h-index
- MJ
2
h-index
- DK
2
h-index
1–5 of 134
Institutions
65
Universidade do Porto
Porto, Portugal
3 h-index
4 publications
230 citations
University of Manchester
Manchester, United Kingdom
2 h-index
4 publications
186 citations
University of California, Irvine
Irvine, United States
2 h-index
3 publications
213 citations
University of Illinois Chicago
Chicago, United States
2 h-index
3 publications
49 citations
University of Edinburgh
Edinburgh, United Kingdom
2 h-index
2 publications
58 citations
KU Leuven
Leuven, Belgium
2 h-index
4 publications
168 citations
Turing Institute
Glasgow, United Kingdom
2 h-index
4 publications
754 citations
University of Bari Aldo Moro
Bari, Italy
2 h-index
8 publications
544 citations
1–8 of 65
Venues
- Machine Learning
10 publications · 28.5K citations
10
h-index
- Theoretical Computer Science
4 publications · 94 citations
4
h-index
- Expert Systems with Applications
2 publications · 42 citations
2
h-index
- Journal of Combinatorial Theory Series B
2 publications · 119 citations
2
h-index
- Information Processing Letters
2 publications · 75 citations
2
h-index
1–5