Bi-criteria optimization problem for decision and inhibitory trees: Cost versus cost

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

*Corresponding author for this work

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


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.

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

Publication series

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

Bibliographical note

Publisher Copyright:
© 2020, Springer Nature Switzerland AG.

ASJC Scopus subject areas

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


Dive into the research topics of 'Bi-criteria optimization problem for decision and inhibitory trees: Cost versus cost'. Together they form a unique fingerprint.

Cite this