In this chapter, we study algorithmic problems related to the global 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. We also discuss the notion of a proper weighted depth for which the problems of computation of the minimum complexity of decision trees and problems of construction of decision trees with the minimum complexity are decidable if the problem of solvability of systems of equations over information systems is decidable.
|Original language||English (US)|
|Title of host publication||Intelligent Systems Reference Library|
|Number of pages||5|
|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