Evolutionary Algorithm for Decision Tree Induction

Abstract : Decision trees are among the most popular classification algorithms due to their knowledge representation in form of decision rules which are easy for interpretation and analysis. Nonetheless, a majority of decision trees training algorithms base on greedy top-down induction strategy which has the tendency to develop too complex tree structures. Therefore, they are not able to effectively generalise knowledge gathered in learning set. In this paper we propose EVO-Tree hybrid algorithm for decision tree induction. EVO-Tree utilizes evolutionary algorithm based training procedure which processes population of possible tree structures decoded in the form of tree-like chromosomes. Training process aims at minimizing objective functions with two components: misclassification rate and tree size. We test the predictive performance of EVO-Tree using several public UCI data sets, and we compare the results with various state-of-the-art classification algorithms.
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01405549
Contributor : Hal Ifip <>
Submitted on : Wednesday, November 30, 2016 - 10:42:28 AM
Last modification on : Thursday, December 1, 2016 - 1:04:16 AM
Document(s) archivé(s) le : Monday, March 27, 2017 - 7:44:07 AM

File

978-3-662-45237-0_4_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Dariusz Jankowski, Konrad Jackowski. Evolutionary Algorithm for Decision Tree Induction. 13th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Nov 2014, Ho Chi Minh City, Vietnam. pp.23-32, ⟨10.1007/978-3-662-45237-0_4⟩. ⟨hal-01405549⟩

Share

Metrics

Record views

118

Files downloads

1244