Abstract
In this chapter, we consider some reductions which will be used later in the investigations of decision trees in the framework of the global approach. We consider relationships among decision trees for problems and decision trees for decision tables. We prove that, instead of arbitrary classes of information systems, we can consider classes containing only one information system. We discuss some operations on sccf-triples, relationships between matrices of upper local and global bounds for sccf-triples, and possibilities to transfer results from one signature to another.
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.: 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)
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). Some Reductions. 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_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-41728-4_18
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)