An empirical comparison of pruning methods for ensemble classifiers
From MaRDI portal
Recommendations
Cited in
(14)- A \(k\)-norm pruning algorithm for decision tree classifiers based on error rate estimation
- Accurate ensemble pruning with PL-bagging
- A novel margin-based measure for directed hill climbing ensemble pruning
- scientific article; zbMATH DE number 2089094 (Why is no real title available?)
- scientific article; zbMATH DE number 1333813 (Why is no real title available?)
- Using J-pruning to reduce overfitting of classification rules in noisy domains
- Effect of pruning and early stopping on performance of a boosting ensemble.
- Cost complexity-based pruning of ensemble classifiers
- Joint leaf-refinement and ensemble pruning through L₁ regularization
- Simplification of forest classifiers and regressors by sharing branching conditions
- 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
- Taxonomy for characterizing ensemble methods in classification tasks: a review and annotated bibliography
This page was built for publication: An empirical comparison of pruning methods for ensemble classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4444484)
