Abstract
A comparison among different heuristics that are used by greedy algorithms which constructs approximate decision trees (α-decision trees) is presented. The comparison is conducted using decision tables based on 24 data sets from UCI Machine Learning Repository [2]. Complexity of decision trees is estimated relative to several cost functions: depth, average depth, number of nodes, number of nonterminal nodes, and number of terminal nodes. Costs of trees built by greedy algorithms are compared with minimum costs calculated by an algorithm based on dynamic programming. The results of experiments assign to each cost function a set of potentially good heuristics that minimize it. © 2011 Springer-Verlag.
Original language | English (US) |
---|---|
Title of host publication | Rough Sets and Knowledge Technology |
Publisher | Springer Nature |
Pages | 178-186 |
Number of pages | 9 |
ISBN (Print) | 9783642244247 |
DOIs | |
State | Published - 2011 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science