Abstract
In this chapter, we consider various types of decision and inhibitory trees. We discuss the notion of a cost function for trees, the notion of decision tree uncertainty, and the notion of inhibitory tree completeness. We consider also an algorithm for counting the number of decision trees represented by a directed acyclic graph.
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
Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth and Brooks, Monterey (1984)
Moshkov, M.: Time complexity of decision trees. In: Peters, J.F., Skowron, A. (eds.) Trans. Rough Sets III. Lecture Notes in Computer Science, vol. 3400, pp. 244–459. Springer, Berlin (2005)
Rokach, L., Maimon, O.: Data Mining with Decision Trees: Theory and Applications. World Scientific Publishing, River Edge (2008)
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). Decision and Inhibitory Trees. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-12854-8_6
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)