Bi-criteria optimization problem for rules and systems of rules: Cost versus uncertainty (completeness)

Fawaz Alsolami*, Mohammad Azad, Igor Chikalov, Mikhail Moshkov

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this chapter, we consider algorithms which construct the sets of Pareto optimal points for bi-criteria optimization problems for decision (inhibitory) rules and rule systems relative to a cost function and an uncertainty (completeness) measure. 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 function and uncertainty (completeness) measure. Computer experiments provide us with examples of trade-off between complexity and accuracy for decision and inhibitory rule systems.

Original languageEnglish (US)
Title of host publicationIntelligent Systems Reference Library
PublisherSpringer Science and Business Media Deutschland GmbH
Pages225-241
Number of pages17
DOIs
StatePublished - 2020

Publication series

NameIntelligent Systems Reference Library
Volume156
ISSN (Print)1868-4394
ISSN (Electronic)1868-4408

ASJC Scopus subject areas

  • General Computer Science
  • Information Systems and Management
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'Bi-criteria optimization problem for rules and systems of rules: Cost versus uncertainty (completeness)'. Together they form a unique fingerprint.

Cite this