TY - CHAP
T1 - Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sorting
AU - Azad, Mohammad
AU - Chikalov, Igor
AU - Hussain, Shahid
AU - Moshkov, Mikhail
AU - Zielosko, Beata
N1 - KAUST Repository Item: Exported on 2022-12-02
PY - 2022/11/19
Y1 - 2022/11/19
N2 - In this chapter, we study the problem of recognition of monotone Boolean functions with n variables, n=2,…,4, and the problem of sorting n pairwise different elements from linearly ordered set, n=3,…,6. For each of these problems, we compare the complexity of five types of optimal (relative to the depth or the number of realizable nodes) decision trees. We also study the complexity of decision trees constructed by greedy algorithms and analyze the length of decision rules derived from these trees.
AB - In this chapter, we study the problem of recognition of monotone Boolean functions with n variables, n=2,…,4, and the problem of sorting n pairwise different elements from linearly ordered set, n=3,…,6. For each of these problems, we compare the complexity of five types of optimal (relative to the depth or the number of realizable nodes) decision trees. We also study the complexity of decision trees constructed by greedy algorithms and analyze the length of decision rules derived from these trees.
UR - http://hdl.handle.net/10754/677260
UR - https://link.springer.com/10.1007/978-3-031-08585-7_6
U2 - 10.1007/978-3-031-08585-7_6
DO - 10.1007/978-3-031-08585-7_6
M3 - Chapter
SN - 9783031085840
SP - 73
EP - 80
BT - Decision Trees with Hypotheses
PB - Springer International Publishing
ER -