Extensions of dynamic programming for decision tree study

3^rd International conference on Artificial Intelligence & Robotics

June 28-29, 2017 San Diego, USA

Mikhail Moshkov

King Abdullah University of Science and Technology, KSA

Keynote: Adv Robot Autom

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 (1) to describe the set of optimal decision trees, (2) to count the number of these trees, (3) to make sequential optimization of decision trees relative to different criteria, (4) to find the set of Pareto optimal points for two criteria, and (5) 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 Boolean functions, 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 a Professor in the CEMSE Division at King Abdullah University of Science and Technology, Saudi Arabia. He has earned his Master’s degree from Nizhni Novgorod State University, received his Doctorate degree from Saratov State University and Habilitation from Moscow State University. He was with Nizhni Novgorod State University for a few years, later he worked in Poland in the Institute of Computer Science, University of Silesia and also in the Katowice Institute of Information Technologies. His main areas of research are complexity of algorithms, combinatorial optimization and machine learning. He is the author or co-author of five research monographs published by Springer.

Email: mikhail.moshkov@kaust.edu.sa