An optimal constrained pruning strategy for decision trees

DOI10.1287/IJOC.1080.0278MaRDI QIDQ2901047zbMATH OpenOpenAlexFDO

Authors Hanif D. Sherali, Antoine G. Hobeika, Chawalit Jeenanunta

Publication date 28 July 2012

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

Full work available at URL http://hdl.handle.net/10919/25833

zbMATH Keywords

analysis of algorithmsdecision analysisinteger programmingtransportation

Mathematics Subject Classification ID

Decision theory (91B06) Analysis of algorithms (68W40) Integer programming (90C10) Artificial intelligence (68T99)

Recommendations

• An efficient algorithm for optimal pruning of decision trees
• A dynamic programming based pruning method for decision trees
• An MLE strategy for combining optimally pruned decision trees
• An investigation on the conditions of pruning an induced decision tree
• Learning optimal decision trees using constraint programming
• Analysis of a complexity-based pruning scheme for classification trees
• scientific article; zbMATH DE number 2219698
• Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme

Cited in

(8)

• Mathematical optimization in classification and regression trees
• An efficient algorithm for optimal pruning of decision trees
• An MLE strategy for combining optimally pruned decision trees
• Pruning of CRT-sub-trees
• scientific article; zbMATH DE number 2219698 (Why is no real title available?)
• An investigation on the conditions of pruning an induced decision tree
• An adaptive pruning algorithm for the discrete L-curve criterion
• Recent Advances in Constraints

Describes a project that uses

Uses Software

• TRANSIMS

This page was built for publication: An optimal constrained pruning strategy for decision trees

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