FBP: a frontier-based tree-pruning algorithm

DOI10.1287/IJOC.1050.0133MaRDI QIDQ2892305zbMATH OpenOpenAlexFDO

Authors Xiaoming Huo, Seoung Bum Kim, Kwok-Leung Tsui, Shuchun Wang

Publication date 18 June 2012

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

Full work available at URL https://semanticscholar.org/paper/347c3ed639bed26f5ab4e809f1430e912a73a9cd

zbMATH Keywords

classificationdata miningdecision treestree pruning

Mathematics Subject Classification ID

General considerations in statistical decision theory (62C05) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Analysis of a complexity-based pruning scheme for classification trees
• Maximum a posteriori pruning on decision trees and its application to bootstrap bumping
• Model Selection for CART Regression Trees
• A comparison of pruning criteria for probability trees
• An alternative pruning based approach to unbiased recursive partitioning

Cited in

(5)

• Analysis of a complexity-based pruning scheme for classification trees
• Controlling the False Discovery Rate for Feature Selection in High‐resolution NMR Spectra
• Analysis of Large Heterogeneous Repairable System Reliability Data With Static System Attributes and Dynamic Sensor Measurement in Big Data Environment
• A single interval based classifier
• Maximum a posteriori pruning on decision trees and its application to bootstrap bumping

This page was built for publication: FBP: a frontier-based tree-pruning algorithm

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