Conference abstract · 7 Sep 2017
Conference abstractPublished 2018
Dynamic programming extensions for decision and inhibitory 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.
We discuss extensions of dynamic programming approach to the study of decision and inhibitory trees. Decision trees are used as algorithms for problem solving, as a way for knowledge representation, and as classifiers. Inhibitory trees, in which terminal nodes are labeled by expressions “≠ decision”, can for some decision tables represent more knowledge from these tables than decision trees. The created extensions of dynamic programming allow us, (i) to make multi-stage optimization of decision trees relative to different criteria, (ii) to describe the set of optimal trees and count the number of these trees, (iii) to find the set of Pareto optimal points for two criteria and describe relationships between these criteria. We show how the mentioned tools can be used for the study of inhibitory trees. The results include the minimization of average depth for decision trees sorting eight elements, finding of tight upper bounds on the depth of decision trees for diagnosis of constant faults in combinatorial circuits, existence of optimal relative to a number of criteria, simultaneously, decision trees for Boolean functions, investigation of time-memory tradeoff for decision trees for corner point detection, study of relationships between maximum length and number of decision rules induced from decision trees, study of accuracy-size tradeoff for decision trees which allows us to construct trees that, as classifiers, outperform often trees constructed by CART.
Subjects
Computer Science & ITEngineeringAsk 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 · 26 Sep 2016
Extensions of dynamic programming for decision tree study
Conference abstract · 16 Apr 2018
Extensions of dynamic programming for decision and inhibitory tree study
Editorial · 2018
Data Mining 2016:Extensions of dynamic programming for decision tree study- Mikhail Moshkov - King Abdullah University of Science and Technology
Conference abstract · 28 Jun 2017
Extensions of Dynamic Programming for Decision Tree Study
More from this journal
The newest in Journal of Computer Engineering & Information Technology.
Review article · 27 Oct 2025
Dukan Daari Inventory Management System
Research article · 17 Jun 2025
Leveraging Information Flow Tracking for Enhanced Security in Cloud Computing
Editorial · 31 Mar 2025
Low-Code/No-Code Platforms: Democratizing Software Development
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalJournal of Computer Engineering & Information Technology
- SubjectComputer Science & IT
- SubjectEngineering
- BylineArticles whose byline prints “Mikhail Moshkov”

