Earlier, some relatively simple results were considered for binary decision tables with many-valued decisions: relationships among decision trees, rules and tests, bounds on their complexity, greedy algorithms for construction of decision trees, rules and tests, and dynamic programming algorithms for minimization of tree depth and rule length. In this chapter, we mention these results without proofs and extend them to inhibitory trees, tests, rules and rule systems over binary decision tables with many-valued decisions.
|Original language||English (US)|
|Title of host publication||Intelligent Systems Reference Library|
|Publisher||Springer Science and Business Media Deutschland GmbH|
|Number of pages||29|
|State||Published - 2020|
|Name||Intelligent Systems Reference Library|
Bibliographical notePublisher Copyright:
© 2020, Springer Nature Switzerland AG.
ASJC Scopus subject areas
- Computer Science(all)
- Information Systems and Management
- Library and Information Sciences