TY - GEN
T1 - Greedy heuristics for minimization of number of terminal nodes in decision trees
AU - Hussain, Shahid
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2014/10
Y1 - 2014/10
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/564999
UR - http://ieeexplore.ieee.org/document/6982817/
UR - http://www.scopus.com/inward/record.url?scp=84920723583&partnerID=8YFLogxK
U2 - 10.1109/GRC.2014.6982817
DO - 10.1109/GRC.2014.6982817
M3 - Conference contribution
SN - 9781479954643
SP - 112
EP - 115
BT - 2014 IEEE International Conference on Granular Computing (GrC)
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -