Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256–278 (1974)
Moshkov, M., Zielosko, B.: Combinatorial Machine Learning - A Rough Set Approach, Studies in Computational Intelligence, vol. 360. Springer, Heidelberg (2011)
Nigmatullin, R.: Method of steepest descent in problems on cover. In: Symposium Problems of Precision and Efficiency of Computing Algorithms (in Russian), vol. 5, pp. 116–126. Kiev, USSR (1969)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Alsolami, F., Azad, M., Chikalov, I., Moshkov, M. (2020). Preliminary Results for Decision and Inhibitory Trees, Tests, Rules, and Rule Systems. In: Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions. Intelligent Systems Reference Library, vol 156. Springer, Cham. https://doi.org/10.1007/978-3-030-12854-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-12854-8_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-12853-1
Online ISBN: 978-3-030-12854-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)