Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

An optimised decision tree induction algorithm for real world data domains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bandar, Z. ; Manchester Metropolitan Univ., UK ; O'Shea, J.D. ; Mclean, D.

A major weakness of step-wise decision tree (DT) induction algorithms such as ID3 (J.R. Quinlan, 1986) and CHAID (G.V. Kass, 1980) is the lack of a globally optimal search strategy. These algorithms perform a heuristic search which selects the best local attribute/values split for each internal node. No account is taken of the impact on subsequent splits. Once a split is selected, these algorithms have no backtracking mechanism to enable them to change an attribute split. A genetic algorithm (GA) performs a nonlinear search for the optimal or near optimal solution in a pre-defined search space. The paper asserts that GAs are an effective alternative to the step-wise search strategy employed by traditional DT induction algorithms. We present a novel GA based DT induction algorithm that has been applied to three well-known data sets. Results indicate that this algorithm has produced more accurate decision trees

Published in:

Neural Information Processing, 1999. Proceedings. ICONIP '99. 6th International Conference on  (Volume:2 )

Date of Conference:

1999