Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Evolutionary Algorithms for Global Decision Tree Induction

Evolutionary Algorithms for Global Decision Tree Induction
View Sample PDF
Author(s): Marek Kretowski (Bialystok University of Technology, Poland) and Marcin Czajkowski (Bialystok University of Technology, Poland)
Copyright: 2019
Pages: 12
Source title: Advanced Methodologies and Technologies in Business Operations and Management
Source Author(s)/Editor(s): Mehdi Khosrow-Pour, D.B.A. (Information Resources Management Association, USA)
DOI: 10.4018/978-1-5225-7362-3.ch050


View Evolutionary Algorithms for Global Decision Tree Induction on the publisher's website for pricing and purchasing information.


Decision trees represent one of the main predictive techniques in knowledge discovery. This chapter describes evolutionary-induced trees, which are emerging alternatives to the greedy top-down solutions. Most typical tree-based systems search only for locally optimal decisions at each node and do not guarantee the optimal solution. Application of evolutionary algorithms to the problem of decision tree induction allows searching for the structure of the tree, tests in internal nodes, and regression functions in the leaves (for model trees) at the same time. As a result, such globally induced decision trees are able to avoid local optima and usually lead to better prediction than the greedy counterparts.

Related Content

Veronica Baena, Marina Mattera. © 2021. 17 pages.
Raymond T. Stefani. © 2021. 19 pages.
Mauro Palmero, Kelly Price. © 2021. 38 pages.
Hyun Byun, Weisheng Chiu, Jung-sup Bae. © 2021. 17 pages.
Ho Keat Leng, Xinran Wu, Deping Zhong. © 2021. 14 pages.
Shi Ying Tan, Do Young Pyun. © 2021. 13 pages.
Ali Ahmed Abdelkader, Hussein Moselhy Syead Ahmed. © 2021. 23 pages.
Body Bottom