A dynamic programming based pruning method for decision trees

DOI10.1287/IJOC.13.4.332.9732MaRDI QIDQ2884515zbMATH OpenOpenAlexFDO

Authors Xiaobai Li, James Sweigart, James Teng, Joan Donohue, Lori Thombs

Publication date 30 May 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.13.4.332.9732

zbMATH Keywords

classificationdata miningdecision treesdynamic programmingpruning method

Mathematics Subject Classification ID

Dynamic programming (90C39) Decision theory (91B06)

Recommendations

• A \(k\)-norm pruning algorithm for decision tree classifiers based on error rate estimation
• scientific article; zbMATH DE number 2219698
• An efficient algorithm for optimal pruning of decision trees
• The effects of pruning methods on the predictive accuracy of induced decision trees
• scientific article; zbMATH DE number 2161554

Cited in

(8)

• A \(k\)-norm pruning algorithm for decision tree classifiers based on error rate estimation
• An investigation on the conditions of pruning an induced decision tree
• An efficient algorithm for optimal pruning of decision trees
• Pruning of CRT-sub-trees
• Diversification for better classification trees
• An optimal constrained pruning strategy for decision trees
• scientific article; zbMATH DE number 2219698 (Why is no real title available?)
• Post-pruning in decision tree induction using multiple performance measures

This page was built for publication: A dynamic programming based pruning method for decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884515)