Abstract
In this chapter, we study algorithmic problems related to the local approach to the investigation of decision trees: problems of computation of the minimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, problems of construction of decision trees with the minimum complexity, and the problem of solvability of systems of equations over information systems. We study relationships among these problems and describe all variants of algorithmic problem behavior. We also discuss an algorithm for decision table construction and two algorithms that construct deterministic decision trees.
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
Moshkov, M.: Decision Trees. Theory and Applications (in Russian). Nizhny Novgorod University Publishers, Nizhny Novgorod (1994)
Moshkov, M.: Time complexity of decision trees. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III, Lecture Notes in Computer Science, vol. 3400, pp. 244–459. Springer, Berlin (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Moshkov, M. (2020). Algorithmic Problems. Local Approach. In: Comparative Analysis of Deterministic and Nondeterministic Decision Trees. Intelligent Systems Reference Library, vol 179. Springer, Cham. https://doi.org/10.1007/978-3-030-41728-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-41728-4_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41727-7
Online ISBN: 978-3-030-41728-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)