Scholars Central

Conference abstractPublished 16 Apr 2018

Extensions of dynamic programming for decision and inhibitory tree study

Authors: Mikhail Moshkov

King Abdullah University of Science and Technology, Saudi Arabia

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

In this 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 to describe the set of optimal decision trees; to count the number of these trees; to make sequential optimization of decision trees relative to different criteria; to find the set of Pareto optimal points for two criteria, and 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. We describe how the considered tools can be used for the study of inhibitory trees in which terminal nodes are labeled by expressions âÂ?Â?âÂ? decisionâÂ?? The end of the presentation is devoted to the introduction to KAUST.

Ask 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.

Try:

Similar by topic

More from this journal

The newest in Advances in Robotics & Automation.

All its articles

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.

  • JournalAdvances in Robotics & Automation
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Mikhail Moshkov”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels