Abstract
In this chapter, we discuss main notions and notation for the local approach to the study of decision trees for problems. We consider information systems, decision trees over information systems, problems over information systems, classes of information systems, relationships among different parameters of problems, and upper and lower types of these relationships.
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.: Comparative analysis of deterministic and nondeterministic decision tree complexity, Global approach. Fundam. Inform. 25(2), 201–214 (1996)
Moshkov, M.: Unimprovable upper bounds on time complexity of decision trees. Fundam. Inform. 31(2), 157–184 (1997)
Moshkov, M.: Comparative analysis of deterministic and nondeterministic decision tree complexity, Local approach. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets IV, Lecture Notes in Computer Science, vol. 3700, pp. 125–143. Springer, Berlin (2005)
Pawlak, Z.: Information systems theoretical foundations. Inf. Syst. 6(3), 205–218 (1981)
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). Basic Definitions and Notation. 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-41728-4_9
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)