.png){kind=icon}
.png){kind=icon}
Return
Towards improving decision tree induction by combining split evaluation measures
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2023.110832.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Explainability is essential for users to effectively understand, trust, and manage powerful artificial intelligence solutions. Decision trees are one of the pioneer explanaible artificial intelligence algorithms widely used by experts in several contexts. C4.5 is a prominent decision tree that continues to serve as the base for subsequent improvements. One of main pillars on the decision tree induction is the split evaluation measure used for assesing the candidate splits. Usually, one single split evaluation measure is used during the induction procedure. However, combining multiple split evaluation measures into the induction procedure could improve the classification results. Our proposal aims to obtain better classification results by selecting the best candidate split taking advantage of the power of voting methods to aggregate the ranking issued by multiple split evaluation measures. Consequently, we performed a set of experiments to appraise the performance of our proposal on 114 databases. From these experiments, two novel split evaluation measures, proposed in this paper, were assessed against 11 individual and prominent state-of-the-art split evaluation measures. Our classification results show that our proposal outperforms the other state-of-the-art split evaluation measures.& COPY; 2023 Elsevier B.V. All rights reserved.
Keywords:
Supervised classification
Decision tree
Evaluation measure
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W