The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Evolutionary Algorithms for Global Decision Tree Induction
Abstract
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 system searches 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 tree is able to avoid local optima and usually leads to better prediction than the greedy counterparts.
Related Content
|
Yair Wiseman.
© 2021.
11 pages.
|
|
Mário Pereira Véstias.
© 2021.
15 pages.
|
|
Mahfuzulhoq Chowdhury, Martin Maier.
© 2021.
15 pages.
|
|
Gen'ichi Yasuda.
© 2021.
12 pages.
|
|
Alba J. Jerónimo, María P. Barrera, Manuel F. Caro, Adán A. Gómez.
© 2021.
19 pages.
|
|
Gregor Donaj, Mirjam Sepesy Maučec.
© 2021.
14 pages.
|
|
Udit Singhania, B. K. Tripathy.
© 2021.
11 pages.
|
|
|