In this chapter, we study algorithmic problems related to the local approach to the investigation of decision trees: problems of computation of the minimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, problems of construction of decision trees with the minimum complexity, and the problem of solvability of systems of equations over information systems. We study relationships among these problems and describe all variants of algorithmic problem behavior. We also discuss an algorithm for decision table construction and two algorithms that construct deterministic decision trees.
|Original language||English (US)|
|Title of host publication||Intelligent Systems Reference Library|
|Number of pages||8|
|State||Published - 2020|
|Name||Intelligent Systems Reference Library|
Bibliographical notePublisher Copyright:
© 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.
ASJC Scopus subject areas
- Computer Science(all)
- Information Systems and Management
- Library and Information Sciences