Abstract
In this chapter, we present greedy algorithms based on diverse uncertainty measures for the construction of decision trees with hypotheses and discuss the results of computer experiments on various data sets and randomly generated Boolean functions. We also study the length and coverage of decision rules derived from the decision trees constructed by greedy algorithms.
Original language | English (US) |
---|---|
Title of host publication | Decision Trees with Hypotheses |
Publisher | Springer International Publishing |
Pages | 55-72 |
Number of pages | 18 |
ISBN (Print) | 9783031085840 |
DOIs | |
State | Published - Nov 19 2022 |