An MLE strategy for combining optimally pruned decision trees

DOI10.1007/978-3-642-57678-2_26MaRDI QIDQ3297946zbMATH OpenOpenAlexFDO

Authors Carmela Cappelli, William Shannon

Publication date 21 July 2020

Published in COMPSTAT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-57678-2_26

zbMATH Keywords

minimum mean distanceprobability distributionpruningsimplificationtrees-based models

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• An optimal constrained pruning strategy for decision trees
• A comparison of pruning criteria for probability trees
• Three Steps Strategy to Search for Optimum Classification Trees
• scientific article; zbMATH DE number 5158877
• Analysis of a complexity-based pruning scheme for classification trees

Cites work

• Breast Cancer Diagnosis and Prognosis Via Linear Programming
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• Metric models for random graphs

Cited in

(3)

• A \(k\)-norm pruning algorithm for decision tree classifiers based on error rate estimation
• An optimal constrained pruning strategy for decision trees
• Maximum a posteriori pruning on decision trees and its application to bootstrap bumping

This page was built for publication: An MLE strategy for combining optimally pruned decision trees

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