Editorial · 2018
Conference abstractPublished 16 Nov 2015
Extensions of dynamic programming for decision tree study
King Abdullah University of Science and Technology, Saudi Arabia
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
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.
Subjects
Mathematics & StatisticsAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Conference abstract · 7 Sep 2017
Extensions of Dynamic Programming: Applications for Decision Trees
Conference abstract · 16 Apr 2018
Extensions of dynamic programming for decision and inhibitory tree study
Conference abstract · 2018
Dynamic programming extensions for decision and inhibitory tree study
Conference abstract · 28 Jun 2017
Extensions of Dynamic Programming for Decision Tree Study
More from this journal
The newest in Journal of Applied & Computational Mathematics.
Article · 31 Mar 2025
Multiscale Modeling: From Atoms to System
Article · 31 Mar 2025
Stochastic Models: Managing Uncertainty in Diverse Field
Article · 31 Mar 2025
Modern Differential Equations: Numerical, Theoretical, Applied
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalJournal of Applied & Computational Mathematics
- SubjectMathematics & Statistics
- BylineArticles whose byline prints “Mikhail Moshkov”

