Advertisement
Published in:
2011 | OriginalPaper | Chapter
Comparison of Greedy Algorithms for α-Decision Tree Construction
Authors : Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov
Published in: Rough Sets and Knowledge Technology
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.