Abstract
In this chapter, we study bi-criteria optimization problem cost versus cost for decision and inhibitory trees. We design an algorithm which constructs the set of Pareto optimal points for bi-criteria optimization problem for decision trees, and show how the constructed set can be transformed into the graphs of functions that describe the relationships between the studied cost functions. We extend the obtained results to the case of inhibitory trees. We consider two applications: study of 12 greedy heuristics as algorithms for single- and bi-criteria optimization of decision and inhibitory trees, and study of two relationships for decision trees related to knowledge representation—number of nodes versus depth and number of nodes versus average depth.
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, Berlin (2019)
Alkhalid, A., Amin, T., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Dagger: a tool for analysis and optimization of decision trees and rules. In: Ficarra, F.V.C., Kratky, A., Veltman, K.H., Ficarra, M.C., Nicol, E., Brie, M. (eds.) Computational Informatics, Social Factors and New Information Technologies: Hypermedia Perspectives and Avant-Garde Experiencies in the Era of Communicability Expansion, pp. 29–39. Blue Herons (2011)
Alkhalid, A., Chikalov, I., Moshkov, M.: Comparison of greedy algorithms for decision tree construction. In: Filipe, J., Fred, A.L.N. (eds.) International Conference on Knowledge Discovery and Information Retrieval, KDIR 2011, Paris, France, 26–29 Oct 2011, pp. 438–443. SciTePress (2011)
Alkhalid, A., Chikalov, I., Moshkov, M.: Decision tree construction using greedy algorithms and dynamic programming – comparative study. In: Szczuka, M., Czaja, L., Skowron, A., Kacprzak, M. (eds.) 20th International Workshop on Concurrency, Specification and Programming, CS&P 2011, Pultusk, Poland, 28–30 Sept 2011, pp. 1–9. Białystok University of Technology (2011)
Alkhalid, A., Amin, T., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Optimization and analysis of decision trees and rules: dynamic programming approach. Int. J. Gen. Syst. 42(6), 614–634 (2013)
Azad, M., Moshkov, M.: Minimization of decision tree average depth for decision tables with many-valued decisions. In: Jedrzejowicz, P., Jain, L.C., Howlett, R.J., Czarnowski, I. (eds.) 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, KES 2014, Gdynia, Poland, 15–17 Sept 2014. Procedia Computer Science, vol. 35, pp. 368–377. Elsevier (2014)
Azad, M., Moshkov, M.: Minimization of decision tree depth for multi-label decision tables. In: 2014 IEEE International Conference on Granular Computing, GrC 2014, Noboribetsu, Japan, 22–24 Oct 2014, pp. 7–12. IEEE Computer Society (2014)
Azad, M., Moshkov, M.: Minimizing size of decision trees for multi-label decision tables. In: Ganzha, M., Maciaszek, L.A., Paprzycki, M. (eds.) 2014 Federated Conference on Computer Science and Information Systems, FedCSIS 2014, Warsaw, Poland, 7–10 Sept 2014, pp. 67–74 (2014)
Azad, M., Moshkov, M.: Classification and optimization of decision trees for inconsistent decision tables represented as MVD tables. In: Ganzha, M., Maciaszek, L.A., Paprzycki, M. (eds.) 2015 Federated Conference on Computer Science and Information Systems, FedCSIS 2015, Lódz, Poland, 13–16 Sept 2015, pp. 31–38. IEEE (2015)
Chikalov, I., Hussain, S., Moshkov, M.: Relationships between average depth and number of nodes for decision trees. In: Sun, F., Li, T., Li, H. (eds.) Knowledge Engineering and Management, 7th International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2012, Beijing, China, 15–17 Dec 2012. Advances in Intelligent Systems and Computing, vol. 214, pp. 519–529. Springer (2014)
Clare, A., King, R.D.: Knowledge discovery in multi-label phenotype data. In: Raedt, L.D., Siebes, A. (eds.) Principles of Data Mining and Knowledge Discovery, 5th European Conference, PKDD 2001, Freiburg, Germany, 3–5 Sept 2001. Lecture Notes in Computer Science, vol. 2168, pp. 42–53. Springer (2001)
Hüllermeier, E., Beringer, J.: Learning from ambiguously labeled examples. Intell. Data Anal. 10(5), 419–439 (2006)
Hussain, S.: Greedy heuristics for minimization of number of terminal nodes in decision trees. In: 2014 IEEE International Conference on Granular Computing, GrC 2014, Noboribetsu, Japan, 22–24 Oct 2014, pp. 112–115. IEEE Computer Society (2014)
Hussain, S.: Relationships among various parameters for decision tree optimization. In: Faucher, C., Jain, L.C. (eds.) Innovations in Intelligent Machines-4 – Recent Advances in Knowledge Engineering. Studies in Computational Intelligence, vol. 514, pp. 393–410. Springer (2014)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Alsolami, F., Azad, M., Chikalov, I., Moshkov, M. (2020). Bi-criteria Optimization Problem for Decision and Inhibitory Trees: Cost Versus Cost. In: Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions. Intelligent Systems Reference Library, vol 156. Springer, Cham. https://doi.org/10.1007/978-3-030-12854-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-12854-8_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-12853-1
Online ISBN: 978-3-030-12854-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)