In this chapter, for complexity functions having the properties upper bounds on the minimum complexity and algorithms for construction of deterministic decision trees for decision tables are considered. These bounds and algorithms are based on the use of so-called difference-bounded uncertainty measures for decision tables.
|Original language||English (US)|
|Title of host publication||Intelligent Systems Reference Library|
|Number of pages||27|
|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