Math. Comput. Appl. 2024, 29(6), 103; https://doi.org/10.3390/mca29060103 - 9 Nov 2024
Viewed by 380
Abstract
►
Show Figures
This study addresses the challenge of generating accurate and compact oblique decision trees using self-adaptive differential evolution algorithms. Although traditional decision tree induction methods create explainable models, they often fail to achieve optimal classification accuracy. To overcome these limitations, other strategies, such as
[...] Read more.
This study addresses the challenge of generating accurate and compact oblique decision trees using self-adaptive differential evolution algorithms. Although traditional decision tree induction methods create explainable models, they often fail to achieve optimal classification accuracy. To overcome these limitations, other strategies, such as those based on evolutionary computation, have been proposed in the literature. In particular, we evaluate the use of self-adaptive differential evolution variants to evolve a population of oblique decision trees encoded as real-valued vectors. Our proposal includes (1) an alternative initialization strategy that reduces redundant nodes and (2) a fitness function that penalizes excessive leaf nodes, promoting smaller and more accurate decision trees. We perform a comparative performance analysis of these differential evolution variants, showing that while they exhibit similar statistical behavior, the Single-Objective real-parameter optimization (jSO) method produces the most accurate oblique decision trees and is second best in compactness. The findings highlight the potential of self-adaptive differential evolution algorithms to improve the effectiveness of oblique decision trees in machine learning applications.
Full article
Figure 1
