Abstract
In this chapter, we present greedy algorithms based on diverse uncertainty measures for the construction of decision trees with hypotheses and discuss the results of computer experiments on various data sets and randomly generated Boolean functions. We also study the length and coverage of decision rules derived from the decision trees constructed by greedy algorithms.
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
AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M.: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library, vol. 146. Springer (2019)
Aglin, G., Nijssen, S., Schaus, P.: Learning optimal decision trees using caching branch-and-bound search. In: 34th AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 3146–3153 (2020)
Alsolami, F., Azad, M., Chikalov, I., Moshkov, M.: Decision and Inhibitory Trees and Rules for Decision Tables with Many-Valued Decisions. Intelligent Systems Reference Library, vol. 156. Springer (2020)
Azad, M., Chikalov, I., Hussain, S., Moshkov, M.: Entropy-based greedy algorithm for decision trees using hypotheses. Entropy 23(7), 808 (2021). https://doi.org/10.3390/e23070808
Azad, M., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Decision rules derived from optimal decision trees with hypotheses. Entropy 23(12), 1641 (2021). https://doi.org/10.3390/e23121641
Azad, M., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Greedy algorithms for decision trees with hypotheses. arXiv:2203.08848 [cs.CC] (2022). https://doi.org/10.48550/arXiv.2203.08848
Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Chapman and Hall/CRC (1984)
Dua, D., Graff, C.: UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences (2017). http://archive.ics.uci.edu/ml
Narodytska, N., Ignatiev, A., Pereira, F., Marques-Silva, J.: Learning optimal decision trees with SAT. In: 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, pp. 1362–1368 (2018)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann (1993)
Verwer, S., Zhang, Y.: Learning optimal classification trees using a binary linear program formulation. In: 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, pp. 1625–1632 (2019)
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Azad, M., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B. (2022). Greedy Algorithms for Construction of Decision Trees with Hypotheses. In: Decision Trees with Hypotheses. Synthesis Lectures on Intelligent Technologies. Springer, Cham. https://doi.org/10.1007/978-3-031-08585-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-031-08585-7_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-08584-0
Online ISBN: 978-3-031-08585-7
eBook Packages: Synthesis Collection of Technology (R0)eBColl Synthesis Collection 11