A dynamic programming based pruning method for decision trees

A dynamic programming based pruning method for decision trees

0.00 Avg rating0 Votes
Article ID: iaor20032974
Country: United States
Volume: 13
Issue: 4
Start Page Number: 332
End Page Number: 344
Publication Date: Oct 2001
Journal: INFORMS Journal On Computing
Authors: , , , ,
Keywords: datamining
Abstract:

This paper concerns a decision-tree pruning method, a key issue in the development of decision trees. We propose a new method that applies the classical optimization technique, dynamic programming, to a decision-tree pruning procedure. We show that the proposed method generates a sequence of pruned trees that are optimal with respect to tree size. The dynamic-progamming-based pruning (DPP) algorithm is then compared with cost-complexity pruning (CCP) in an experimental study. The results of our study indicate that DPP performs better than CCP in terms of classification accuracy.

Reviews

Required fields are marked *. Your email address will not be published.