Decision and inhibitory trees

Fawaz Alsolami*, Mohammad Azad, Igor Chikalov, Mikhail Moshkov

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

5 Scopus citations

Abstract

In this chapter, we consider various types of decision and inhibitory trees. We discuss the notion of a cost function for trees, the notion of decision tree uncertainty, and the notion of inhibitory tree completeness. We consider also an algorithm for counting the number of decision trees represented by a directed acyclic graph.

Original languageEnglish (US)
Title of host publicationIntelligent Systems Reference Library
PublisherSpringer Science and Business Media Deutschland GmbH
Pages91-103
Number of pages13
DOIs
StatePublished - 2020

Publication series

NameIntelligent Systems Reference Library
Volume156
ISSN (Print)1868-4394
ISSN (Electronic)1868-4408

Bibliographical note

Publisher Copyright:
© 2020, Springer Nature Switzerland AG.

ASJC Scopus subject areas

  • General Computer Science
  • Information Systems and Management
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'Decision and inhibitory trees'. Together they form a unique fingerprint.

Cite this