Global Induction of Oblique Decision Trees: An Evolutionary Approach

  • Krętowski M
  • Grześ M
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new evolutionary algorithm for induction of oblique decision trees is proposed. contrast to the classical top-down approach, it searches for the whole tree at the moment. Specialized genetic operators are developed, which enable modifying both the tree structure and the splitting hyper-planes in non-terminal nodes. The problem of over-fitting can be avoided thanks to suitably defined fitness function. Experimental results on both synthetical and real-life data are presented and compared with obtained by the state-of-the-art decision tree systems.

Cite

CITATION STYLE

APA

Krętowski, M., & Grześ, M. (2006). Global Induction of Oblique Decision Trees: An Evolutionary Approach. In Intelligent Information Processing and Web Mining (pp. 309–318). Springer-Verlag. https://doi.org/10.1007/3-540-32392-9_32

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