Greedy Heuristics for Minimization of Number of Terminal Nodes in Decision Trees

被引:0
|
作者
Hussain, Shahid [1 ]
机构
[1] King Abdullah Univ Sci & Technol, Comp Elect & Math Sci & Engn Div, Thuwal 239556900, Saudi Arabia
关键词
Decision trees; greedy heuristics; number of terminal nodes; Friedman test; Nemenyi ad hoc tests;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper describes, in detail, several greedy heuristics for construction of decision trees. We study the number of terminal nodes of decision trees, which is closely related with the cardinality of the set of rules corresponding to the tree. We compare these heuristics empirically for two different types of datasets (datasets acquired from UCI ML Repository and randomly generated data) as well as compare with the optimal results obtained using dynamic programming method.
引用
收藏
页码:112 / 115
页数:4
相关论文
共 50 条