Book Chapter or Conference Paper Title

Sorting by decision trees with hypotheses (extended abstract)

Faculty / School

School of Mathematics and Computer Science (SMCS)

Department

Department of Computer Science

Was this content written or created while at IBA?

Yes

Document Type

Conference Paper

Publication Date

1-1-2021

Conference Location

Berlin, Germany

Conference Dates

27-28 September 2021

ISBN/ISSN

85115822190 (Scopus)

Series

CEUR Workshop Proceedings

Volume

2951

Issue

1613-0073

First Page

126

Last Page

130

Publisher

CEUR-WS.org

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.

Share

COinS