Preliminary Results for Decision and Inhibitory Trees, Tests, Rules, and Rule Systems
KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Computational Bioscience Research Center (CBRC)
Applied Mathematics and Computational Science Program
Permanent link to this recordhttp://hdl.handle.net/10754/653075
MetadataShow full item record
AbstractEarlier, 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.
CitationAlsolami F, Azad M, Chikalov I, Moshkov M (2019) Preliminary Results for Decision and Inhibitory Trees, Tests, Rules, and Rule Systems. Intelligent Systems Reference Library: 45–73. Available: http://dx.doi.org/10.1007/978-3-030-12854-8_4.