Abstract
In this chapter, lower bounds on complexity of deterministic decision trees for decision tables are studied that are based on the notions of super-cover, super-partition, test, and system of representatives for decision tables. An approach to the proof of lower bounds is also considered which is based on the use of so-called proof-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
Hegedüs, T.: Generalized teaching dimensions and the query complexity of learning. In: Maass, W. (ed.) Proceedings of the Eigth Annual Conference on Computational Learning Theory, COLT 1995, Santa Cruz, California, USA, July 5–8, 1995, pp. 108–117. ACM (1995)
Moshkov, M.: On conditional tests. Sov. Phys. Dokl. 27, 528–530 (1982)
Moshkov, M.: Conditional tests. In: Yablonskii, S.V. (ed.) Problemy Kibernetiki (in Russian), vol. 40, pp. 131–170. Nauka Publishers, Moscow (1983)
Moshkov, M.: Decision Trees. Theory and Applications (in Russian). Nizhny Novgorod University Publishers, Nizhny Novgorod (1994)
Moshkov, M.: About the depth of decision trees computing Boolean functions. Fundam. Inform. 22(3), 203–215 (1995)
Moshkov, M.: Lower bounds for the time complexity of deterministic conditional tests. Diskret. Mat. (in Russian) 8(3), 98–110 (1996). https://doi.org/10.4213/dm538
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)
Moshkov, M., Zielosko, B.: Combinatorial Machine Learning - A Rough Set Approach. Studies in Computational Intelligence, vol. 360. Springer, Heidelberg (2011)
Tarasova, V.P.: Opponent Strategy Method in Optimal Search Problems (in Russian). Moscow University Publishers, Moscow (1988)
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). Lower Bounds on Complexity of Deterministic Decision Trees for Decision Tables. 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-41728-4_3
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)