Minimizing Depth of Decision Trees with Hypotheses

Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations


In this paper, we consider decision trees that use both conventional 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 membership and equivalence queries are allowed. We present dynamic programming algorithms for minimization of the depth of above decision trees and discuss results of computer experiments on various data sets and randomly generated Boolean functions.
Original languageEnglish (US)
Title of host publicationRough Sets
PublisherSpringer International Publishing
Number of pages11
StatePublished - Sep 16 2021

Bibliographical note

KAUST Repository Item: Exported on 2021-09-21
Acknowledgements: Research reported in this publication was supported by King Abdullah University of Science and Technology (KAUST). The authors are greatly indebted to anonymous reviewers for useful comments and suggestions.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Minimizing Depth of Decision Trees with Hypotheses'. Together they form a unique fingerprint.

Cite this