Explainable Ensemble Trees

被引:7
|
作者
Aria, Massimo [1 ]
Gnasso, Agostino [1 ]
Iorio, Carmela [1 ]
Pandolfo, Giuseppe [1 ]
机构
[1] Univ Naples Federico II, Dept Econ & Stat, Naples, Italy
关键词
Machine learning; Random forest; Classification; Explainability;
D O I
10.1007/s00180-022-01312-6
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Ensemble methods are supervised learning algorithms that provide highly accurate solutions by training many models. Random forest is probably the most widely used in regression and classification problems. It builds decision trees on different samples and takes their majority vote for classification and average in case of regression. However, such an algorithm suffers from a lack of explainability and thus does not allow users to understand how particular decisions are made. To improve on that, we propose a new way of interpreting an ensemble tree structure. Starting from a random forest model, our approach is able to explain graphically the relationship structure between the response variable and predictors. The proposed method appears to be useful in all real-world cases where model interpretation for predictive purposes is crucial. The proposal is evaluated by means of real data sets.
引用
收藏
页码:3 / 19
页数:17
相关论文
共 50 条
  • [31] Identifying Competitive Attributes Based on an Ensemble of Explainable Artificial Intelligence
    Lee, Younghoon
    BUSINESS & INFORMATION SYSTEMS ENGINEERING, 2022, 64 (04) : 407 - 419
  • [32] Enhancing Ensemble Learning Using Explainable CNN for Spoof Fingerprints
    Reza, Naim
    Jung, Ho Yub
    SENSORS, 2024, 24 (01)
  • [33] Ensemble of optimal trees, random forest and random projection ensemble classification
    Zardad Khan
    Asma Gul
    Aris Perperoglou
    Miftahuddin Miftahuddin
    Osama Mahmoud
    Werner Adler
    Berthold Lausen
    Advances in Data Analysis and Classification, 2020, 14 : 97 - 116
  • [34] Ensemble of optimal trees, random forest and random projection ensemble classification
    Khan, Zardad
    Gul, Asma
    Perperoglou, Aris
    Miftahuddin, Miftahuddin
    Mahmoud, Osama
    Adler, Werner
    Lausen, Berthold
    ADVANCES IN DATA ANALYSIS AND CLASSIFICATION, 2020, 14 (01) : 97 - 116
  • [35] Explainable Multiple Instance Learning with Instance Selection Randomized Trees
    Komarek, Tomas
    Brabec, Jan
    Somol, Petr
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2021: RESEARCH TRACK, PT II, 2021, 12976 : 715 - 730
  • [36] Explainable and Local Correction of Classification Models Using Decision Trees
    Suzuki, Hirofumi
    Iwashita, Hiroaki
    Takagi, Takuya
    Goto, Keisuke
    Fujishige, Yuta
    Hara, Satoshi
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 8404 - 8413
  • [37] From local explanations to global understanding with explainable AI for trees
    Scott M. Lundberg
    Gabriel Erion
    Hugh Chen
    Alex DeGrave
    Jordan M. Prutkin
    Bala Nair
    Ronit Katz
    Jonathan Himmelfarb
    Nisha Bansal
    Su-In Lee
    Nature Machine Intelligence, 2020, 2 : 56 - 67
  • [38] From local explanations to global understanding with explainable AI for trees
    Lundberg, Scott M.
    Erion, Gabriel
    Chen, Hugh
    DeGrave, Alex
    Prutkin, Jordan M.
    Nair, Bala
    Katz, Ronit
    Himmelfarb, Jonathan
    Bansal, Nisha
    Lee, Su-In
    NATURE MACHINE INTELLIGENCE, 2020, 2 (01) : 56 - 67
  • [39] Shallow decision trees for explainable k-means clustering
    Laber, Eduardo
    Murtinho, Lucas
    Oliveira, Felipe
    PATTERN RECOGNITION, 2023, 137
  • [40] Iterative Oblique Decision Trees Deliver Explainable RL Models
    Engelhardt, Raphael C.
    Oedingen, Marc
    Lange, Moritz
    Wiskott, Laurenz
    Konen, Wolfgang
    ALGORITHMS, 2023, 16 (06)