KAUST DepartmentApplied Mathematics and Computational Science Program
Computer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Permanent link to this recordhttp://hdl.handle.net/10754/562533
MetadataShow full item record
AbstractThis chapter is devoted to the study of 16 types of greedy algorithms for decision tree construction. The dynamic programming approach is used for construction of optimal decision trees. Optimization is performed relative to minimal values of average depth, depth, number of nodes, number of terminal nodes, and number of nonterminal nodes of decision trees. We compare average depth, depth, number of nodes, number of terminal nodes and number of nonterminal nodes of constructed trees with minimum values of the considered parameters obtained based on a dynamic programming approach. We report experiments performed on data sets from UCI ML Repository and randomly generated binary decision tables. As a result, for depth, average depth, and number of nodes we propose a number of good heuristics. © Springer-Verlag Berlin Heidelberg 2013.
CitationAlkhalid, A., Chikalov, I., & Moshkov, M. (2013). Comparison of Greedy Algorithms for Decision Tree Optimization. Intelligent Systems Reference Library, 21–40. doi:10.1007/978-3-642-30341-8_3