An evolutionary algorithm for oblique decision tree induction

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

Abstract

In the paper, a new evolutionary approach to induction of oblique decision trees is described. In each non-terminal node, the specialized evolutionary algorithm is applied to search for a splitting hyperplane. The feature selection is embedded into the algorithm, which allows to eliminate redundant and noisy features at each node. The experimental evaluation of the proposed approach is presented on both synthetic and real datasets.

Cite

CITATION STYLE

APA

Krȩtowski, M. (2004). An evolutionary algorithm for oblique decision tree induction. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3070, pp. 432–437). Springer Verlag. https://doi.org/10.1007/978-3-540-24844-6_63

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