An optimal constrained pruning strategy for decision trees
From MaRDI portal
Publication:2901047
DOI10.1287/IJOC.1080.0278zbMATH Open1243.91029OpenAlexW2133607548MaRDI QIDQ2901047FDOQ2901047
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
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
Decision theory (91B06) Analysis of algorithms (68W40) Integer programming (90C10) Artificial intelligence (68T99)
Cited In (8)
- Mathematical optimization in classification and regression trees
- An adaptive pruning algorithm for the discrete L-curve criterion
- An MLE strategy for combining optimally pruned decision trees
- An investigation on the conditions of pruning an induced decision tree
- Pruning of CRT-sub-trees
- Title not available (Why is that?)
- An efficient algorithm for optimal pruning of decision trees
- Recent Advances in Constraints
Uses Software
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)
