In this chapter, we consider algorithms which construct the sets of Pareto optimal points for bi-criteria optimization problems for decision rules and rule systems relative to two cost functions. We 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. We compare 13 greedy heuristics for construction of decision rules from the point of view of single-criterion optimization (relative to length or coverage) and bi-criteria optimization (relative to length and coverage). At the end of the chapter, we generalize the obtained results to the case of inhibitory rules and systems of inhibitory rules.
|Original language||English (US)|
|Title of host publication||Intelligent Systems Reference Library|
|Publisher||Springer Science and Business Media Deutschland GmbH|
|Number of pages||22|
|State||Published - 2020|
|Name||Intelligent Systems Reference Library|
Bibliographical notePublisher Copyright:
© 2020, Springer Nature Switzerland AG.
ASJC Scopus subject areas
- Computer Science(all)
- Information Systems and Management
- Library and Information Sciences