Extensions of dynamic programming for decision tree study

Journal of Applied & Computational Mathematics

ISSN: 2168-9679

Open Access

Extensions of dynamic programming for decision tree study

4th International Conference and Exhibition on Biometrics & Biostatistics

November 16-18, 2015 San Antonio, USA

Mikhail Moshkov

King Abdullah University of Science and Technology, Saudi Arabia

Keynote: J Appl Computat Math

Abstract :

In the presentation, we consider extensions of dynamic programming approach to the study of decision trees as algorithms for problem solving, as a way for knowledge extraction and representation, and as classifiers which, for a new object given by values of conditional attributes, define a value of the decision attribute. These extensions allow us (i) to describe the set of optimal decision trees, (ii) to count the number of these trees, (iii) to make sequential optimization of decision trees relative to different criteria, (iv) to find the set of Pareto optimal points for two criteria, and (v) to describe relationships between two criteria. The results include the minimization of average depth for decision trees sorting eight elements (this question was open since 1968), improvement of upper bounds on the depth of decision trees for diagnosis of 0-1-faults in read-once combinatorial circuits, existence of totally optimal (with minimum depth and minimum number of nodes) decision trees for monotone Boolean functions with at most six variables, study of time-memory tradeoff for decision trees for corner point detection, study of relationships between number and maximum length of decision rules derived from decision trees, study of accuracy-size tradeoff for decision trees which allows us to construct enough small and accurate decision trees for knowledge representation, and decision trees that, as classifiers, outperform often decision trees constructed by CART. The end of the presentation is devoted to the introduction to KAUST.

Biography :

Mikhail Moshkov is Professor in the CEMSE Division at King Abdullah University of Science and Technology, Saudi Arabia since October 1, 2008. He earned Master’s degree from Nizhni Novgorod State University, received his Doctorate from Saratov State University, and Habilitation from Moscow State University. From 1977 to 2004, he was with Nizhni Novgorod State University. Since 2003, he has been working in Poland in the Institute of Computer Science, University of Silesia, and since 2006, also in the Katowice Institute of Information Technologies. His main areas of research are complexity of algorithms, combinatorial optimization, and machine learning. He is Author or Co-Author of five research monographs published by Springer.


50+ Million Readerbase

Journal Highlights

Google Scholar citation report
Citations: 1282

Journal of Applied & Computational Mathematics received 1282 citations as per Google Scholar report

Journal of Applied & Computational Mathematics peer review process verified at publons

Indexed In

arrow_upward arrow_upward