Abstract
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 greedy algorithm based on entropy for the construction of the above decision trees and discuss the results of computer experiments on various data sets and randomly generated Boolean functions.
Original language | English (US) |
---|---|
Pages (from-to) | 808 |
Journal | Entropy |
Volume | 23 |
Issue number | 7 |
DOIs | |
State | Published - Jun 25 2021 |
ASJC Scopus subject areas
- Physics and Astronomy (miscellaneous)
- Statistical and Nonlinear Physics