Book Chapter or Conference Paper Title
Sorting by decision trees with hypotheses (extended abstract)
Faculty / School
School of Mathematics and Computer Science (SMCS)
Department of Computer Science
Was this content written or created while at IBA?
27-28 September 2021
CEUR Workshop Proceedings
Abstract / Description
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.
Azad, M., Chikalov, I., Hussain, S., & Moshkov, M. (2021). Sorting by decision trees with hypotheses (extended abstract)., 2951 (1613-0073), 126-130. Retrieved from https://ir.iba.edu.pk/faculty-research-series/4