Randomized Decision Trees is a computational model of decision-making under uncertainty that extends deterministic decision trees by incorporating probabilistic choices at internal nodes, thereby defining a distribution over possible computation paths for a given input.
119
Publications
16.8K
Citations
362
Authors
176
Institutions
Publications per year
2017–2026
34
Parents
Publications
119
Gérard Biau, Erwan Scornet · Test · 2016 · 3.9K citations · Full text
Decision trees: a recent overview
Sotiris Kotsiantis · Artificial Intelligence Review · 2011 · 1.6K citations
A System for Induction of Oblique Decision Trees
1994 · 716 citations
Understanding Random Forests: From Theory to Practice
Gilles Louppe · arXiv (Cornell University) · 2014 · 596 citations · Full text
1–5 of 119
Authors
362
- PG
5
h-index
- RM
5
h-index
- LW
5
h-index
- UB
3
h-index
- FM
3
h-index
1–5 of 362
Institutions
176
University of Liège
Liège, Belgium
9 h-index
25 publications
2.2K citations
Centre National de la Recherche Scientifique
Paris, France
6 h-index
20 publications
8.3K citations
University of Bonn
Bonn, Germany
6 h-index
8 publications
310 citations
Microsoft (United States)
Redmond, United States
5 h-index
11 publications
959 citations
Observatoire de la Côte d’Azur
Nice, France
3 h-index
9 publications
321 citations
California Institute of Technology
Pasadena, United States
3 h-index
6 publications
214 citations
University of Lisbon
Lisbon, Portugal
3 h-index
3 publications
107 citations
Universidade de São Paulo
São Paulo, Brazil
3 h-index
3 publications
107 citations
1–8 of 176
Venues
- Astronomy and Astrophysics
3 publications · 107 citations
3
h-index
- Machine Learning
3 publications · 791 citations
3
h-index
- IEEE Transactions on Pattern Analysis and Machine Intelligence
TPAMI · 2 publications · 84 citations
2
h-index
- arXiv (Cornell University)
Repository · 2 publications · 710 citations
2
h-index
- Theoretical Computer Science
2 publications · 39 citations
2
h-index
1–5