Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses

In this paper, we consider decision trees that use both conventional queries based on one attribute each and queries based on hypotheses of values of all attributes. Such decision trees are similar to those studied in exact learning, where membership and equivalence queries are allowed. We present g...

Full description

Bibliographic Details
Main Authors: Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov
Format: Article
Language:English
Published: MDPI AG 2021-06-01
Series:Entropy
Subjects:
Online Access:https://www.mdpi.com/1099-4300/23/7/808