OC1-DE: A differential evolution based approach for inducing oblique decision trees

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes the application of a Differential Evolution based approach for inducing oblique decision trees in a recursive partitioning strategy. Considering that: (1) the task of finding an optimal hyperplane with real-valued coefficients is a complex optimization problem in a continuous space, and (2) metaheuristics have been successfully applied for solving this type of problems, in this work a differential evolution algorithm is applied with the aim of finding near-optimal hyper-planes that will be used as test conditions of an oblique decision tree. The experimental results show that this approach induces more accurate classifiers than those produced by other proposed induction methods.

Cite

CITATION STYLE

APA

Rivera-Lopez, R., Canul-Reich, J., Gámez, J. A., & Puerta, J. M. (2017). OC1-DE: A differential evolution based approach for inducing oblique decision trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10245 LNAI, pp. 427–438). Springer Verlag. https://doi.org/10.1007/978-3-319-59063-9_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free