Preliminary results for decision and inhibitory trees, tests, rules, and rule systems

Fawaz Alsolami; Mohammad Azad; Igor Chikalov; Mikhail Moshkov

doi:10.1007/978-3-030-12854-8_4

Preliminary results for decision and inhibitory trees, tests, rules, and rule systems

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

9 Scopus citations

Abstract

Earlier, some relatively simple results were considered for binary decision tables with many-valued decisions: relationships among decision trees, rules and tests, bounds on their complexity, greedy algorithms for construction of decision trees, rules and tests, and dynamic programming algorithms for minimization of tree depth and rule length. In this chapter, we mention these results without proofs and extend them to inhibitory trees, tests, rules and rule systems over binary decision tables with many-valued decisions.

Original language	English (US)
Title of host publication	Intelligent Systems Reference Library
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	45-73
Number of pages	29
DOIs	https://doi.org/10.1007/978-3-030-12854-8_4
State	Published - 2020

Publication series

Name	Intelligent Systems Reference Library
Volume	156
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

Access to Document

10.1007/978-3-030-12854-8_4

Cite this

@inbook{a94184bf7f1b46c697d35f053fec2f97,

title = "Preliminary results for decision and inhibitory trees, tests, rules, and rule systems",

abstract = "Earlier, some relatively simple results were considered for binary decision tables with many-valued decisions: relationships among decision trees, rules and tests, bounds on their complexity, greedy algorithms for construction of decision trees, rules and tests, and dynamic programming algorithms for minimization of tree depth and rule length. In this chapter, we mention these results without proofs and extend them to inhibitory trees, tests, rules and rule systems over binary decision tables with many-valued decisions.",

author = "Fawaz Alsolami and Mohammad Azad and Igor Chikalov and Mikhail Moshkov",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.",

year = "2020",

doi = "10.1007/978-3-030-12854-8_4",

language = "English (US)",

series = "Intelligent Systems Reference Library",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "45--73",

booktitle = "Intelligent Systems Reference Library",

address = "Germany",

}

Preliminary results for decision and inhibitory trees, tests, rules, and rule systems. / Alsolami, Fawaz; Azad, Mohammad; Chikalov, Igor et al.
Intelligent Systems Reference Library. Springer Science and Business Media Deutschland GmbH, 2020. p. 45-73 (Intelligent Systems Reference Library; Vol. 156).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Preliminary results for decision and inhibitory trees, tests, rules, and rule systems

AU - Alsolami, Fawaz

AU - Azad, Mohammad

AU - Chikalov, Igor

AU - Moshkov, Mikhail

PY - 2020

Y1 - 2020

N2 - Earlier, some relatively simple results were considered for binary decision tables with many-valued decisions: relationships among decision trees, rules and tests, bounds on their complexity, greedy algorithms for construction of decision trees, rules and tests, and dynamic programming algorithms for minimization of tree depth and rule length. In this chapter, we mention these results without proofs and extend them to inhibitory trees, tests, rules and rule systems over binary decision tables with many-valued decisions.

AB - Earlier, some relatively simple results were considered for binary decision tables with many-valued decisions: relationships among decision trees, rules and tests, bounds on their complexity, greedy algorithms for construction of decision trees, rules and tests, and dynamic programming algorithms for minimization of tree depth and rule length. In this chapter, we mention these results without proofs and extend them to inhibitory trees, tests, rules and rule systems over binary decision tables with many-valued decisions.

UR - http://www.scopus.com/inward/record.url?scp=85063729857&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-12854-8_4

DO - 10.1007/978-3-030-12854-8_4

M3 - Chapter

AN - SCOPUS:85063729857

T3 - Intelligent Systems Reference Library

SP - 45

EP - 73

BT - Intelligent Systems Reference Library

PB - Springer Science and Business Media Deutschland GmbH

ER -

Preliminary results for decision and inhibitory trees, tests, rules, and rule systems

Abstract

Publication series

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this