Contextual Decision Trees

07/13/2022
by   Tommaso Aldinucci, et al.
14

Focusing on Random Forests, we propose a multi-armed contextual bandit recommendation framework for feature-based selection of a single shallow tree of the learned ensemble. The trained system, which works on top of the Random Forest, dynamically identifies a base predictor that is responsible for providing the final output. In this way, we obtain local interpretations by observing the rules of the recommended tree. The carried out experiments reveal that our dynamic method is superior to an independent fitted CART decision tree and comparable to the whole black-box Random Forest in terms of predictive performances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2020

Trees, forests, and impurity-based variable importance

Tree ensemble methods such as random forests [Breiman, 2001] are very po...
research
03/29/2022

Explaining random forest prediction through diverse rulesets

Tree-ensemble algorithms, such as random forest, are effective machine l...
research
11/03/2021

Oblique and rotation double random forest

An ensemble of decision trees is known as Random Forest. As suggested by...
research
07/17/2018

Explicating feature contribution using Random Forest proximity distances

In Random Forests, proximity distances are a metric representation of da...
research
11/30/2021

Modelling hetegeneous treatment effects by quantitle local polynomial decision tree and forest

To further develop the statistical inference problem for heterogeneous t...
research
08/27/2016

Random Forest for Label Ranking

Label ranking aims to learn a mapping from instances to rankings over a ...
research
04/05/2020

XtracTree for Regulator Validation of Bagging Methods Used in Retail Banking

Bootstrap aggregation, known as bagging, is one of the most popular ense...

Please sign up or login with your details

Forgot password? Click here to reset