Abstract
In this chapter, we describe main notions related to decision tables, consider the structure of subtables of a given decision table represented as a directed acyclic graph (DAG), and discuss time complexity of algorithms on DAGs. We also consider classes of decision tables over restricted information systems for which these algorithms have polynomial time complexity depending on the number of conditional attributes in the input decision table.
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.: On the class of restricted linear information systems. Discret. Math. 307(22), 2837–2844 (2007)
Moshkov, M., Chikalov, I.: On algorithm for constructing of decision trees with minimal depth. Fundam. Inform. 41(3), 295–299 (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M. (2019). Some Tools for Decision Tables. In: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library, vol 146. Springer, Cham. https://doi.org/10.1007/978-3-319-91839-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-91839-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91838-9
Online ISBN: 978-3-319-91839-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)