Abstract
In this chapter, we consider algorithms which construct the sets of Pareto optimal points for bi-criteria optimization problems for decision rules and decision rule systems relative two cost functions. We also show how the constructed set of Pareto optimal points can be transformed into the graphs of functions which describe the relationships between the considered cost functions. Further, we use the set of Pareto optimal points to measure the viability of multiple heuristic methods for the construction of systems of decision rules.
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
Hammer, P.L., Kogan, A., Simeone, B., Szedmák, S.: Pareto-optimal patterns in logical analysis of data. Discret. Appl. Math. 144(1–2), 79–102 (2004)
Lichman, M.: UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences (2013). http://archive.ics.uci.edu/ml
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). Bi-criteria Optimization Problem for Decision Rules and Systems of Rules: Cost Versus Cost. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-91839-6_11
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)