Greedy heuristics for minimization of number of terminal nodes in decision trees

Shahid Hussain

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

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.
Original languageEnglish (US)
Title of host publication2014 IEEE International Conference on Granular Computing (GrC)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages112-115
Number of pages4
ISBN (Print)9781479954643
DOIs
StatePublished - Oct 2014

Fingerprint Dive into the research topics of 'Greedy heuristics for minimization of number of terminal nodes in decision trees'. Together they form a unique fingerprint.

Cite this