Cost complexity-based pruning of ensemble classifiers

DOI10.1007/PL00011678MaRDI QIDQ5960741zbMATH OpenOpenAlexFDO

Authors Andreas L. Prodromidis, Salvatore J. Stolfo

Publication date 15 April 2002

Published in Knowledge and Information Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00011678

zbMATH Keywords

classification models

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Collective-agreement-based pruning of ensembles
• scientific article; zbMATH DE number 2033335
• Accurate ensemble pruning with PL-bagging
• Ensemble pruning via semi-definite programming
• Cost-complexity pruning of random forests

Cited in

(13)

• Accurate ensemble pruning with PL-bagging
• A novel margin-based measure for directed hill climbing ensemble pruning
• Optimizing majority voting based systems under a resource constraint for multiclass problems
• Ensemble pruning via semi-definite programming
• scientific article; zbMATH DE number 1945857 (Why is no real title available?)
• scientific article; zbMATH DE number 1966531 (Why is no real title available?)
• scientific article; zbMATH DE number 2033335 (Why is no real title available?)
• FE-CIDIM: fast ensemble of CIDIM classifiers
• Joint leaf-refinement and ensemble pruning through L₁ regularization
• Cost-sensitive ensemble learning: a unifying framework
• Pruning of error correcting output codes by optimization of accuracy-diversity trade off
• Collective-agreement-based pruning of ensembles
• Using boosting to prune double-bagging ensembles

This page was built for publication: Cost complexity-based pruning of ensemble classifiers

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