TY - GEN
T1 - Sorting by decision trees with hypotheses (extended abstract)
AU - Azad, Mohammad
AU - Chikalov, Igor
AU - Hussain, Shahid
AU - Moshkov, Mikhail
N1 - KAUST Repository Item: Exported on 2021-10-06
Acknowledgements: Research reported in this publication was supported by King Abdullah University of Science and Technology (KAUST). The authors are indebted to the anonymous reviewers for interesting comments.
PY - 2021/1/1
Y1 - 2021/1/1
N2 - In this paper, we consider decision trees that use both queries based on one attribute each and queries based on hypotheses about values of all attributes. Such decision trees are similar to ones studied in exact learning, where not only membership but also equivalence queries are allowed. For n = 3,..., 6, we compare decision trees based on various combinations of attributes and hypotheses for sorting n pairwise different elements from linearly ordered set.
AB - In this paper, we consider decision trees that use both queries based on one attribute each and queries based on hypotheses about values of all attributes. Such decision trees are similar to ones studied in exact learning, where not only membership but also equivalence queries are allowed. For n = 3,..., 6, we compare decision trees based on various combinations of attributes and hypotheses for sorting n pairwise different elements from linearly ordered set.
UR - http://hdl.handle.net/10754/672122
UR - http://www.scopus.com/inward/record.url?scp=85115822190&partnerID=8YFLogxK
M3 - Conference contribution
SP - 126
EP - 130
BT - 29th International Workshop on Concurrency, Specification and Programming, CS and P 2021
PB - CEUR-WS
ER -