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 language | English (US) |
---|---|
Title of host publication | Intelligent Systems Reference Library |
Publisher | Springer Science and Business Media Deutschland GmbH |
Pages | 91-103 |
Number of pages | 13 |
DOIs | |
State | Published - 2020 |
Publication series
Name | Intelligent Systems Reference Library |
---|---|
Volume | 156 |
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