Show simple item record

dc.contributor.authorHussain, Shahid*
dc.date.accessioned2015-08-04T07:27:42Zen
dc.date.available2015-08-04T07:27:42Zen
dc.date.issued2014-10en
dc.identifier.isbn9781479954643en
dc.identifier.doi10.1109/GRC.2014.6982817en
dc.identifier.urihttp://hdl.handle.net/10754/564999en
dc.description.abstractThis 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.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectDecision treesen
dc.subjectFriedman testen
dc.subjectgreedy heuristicsen
dc.subjectNemenyi ad hoc testsen
dc.subjectnumber of terminal nodesen
dc.titleGreedy heuristics for minimization of number of terminal nodes in decision treesen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division*
dc.contributor.departmentComputer Science Program*
dc.identifier.journal2014 IEEE International Conference on Granular Computing (GrC)en
dc.conference.date22 October 2014 through 24 October 2014en
dc.conference.name2014 IEEE International Conference on Granular Computing, GrC 2014en
kaust.personHussain, Shahid*


This item appears in the following Collection(s)

Show simple item record