Accurate ensemble pruning with PL-bagging
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 1930922 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A decision-theoretic generalization of on-line learning and an application to boosting
- A weight-adjusted voting algorithm for ensembles of classifiers
- Bagging predictors
- Bundling classifiers by bagging trees
- Double-bagging: Combining classifiers by bootstrap aggregation
- Improving the precision of classification trees
- Least angle regression. (With discussion)
- Random forests
- Trimmed bagging
- Using boosting to prune double-bagging ensembles
Cited in
(8)- Collective-agreement-based pruning of ensembles
- Cost complexity-based pruning of ensemble classifiers
- Joint leaf-refinement and ensemble pruning through \(L_1\) regularization
- Pruning of error correcting output codes by optimization of accuracy-diversity trade off
- Random forest pruning techniques: a recent review
- Using boosting to prune double-bagging ensembles
- Pruning variable selection ensembles
- scientific article; zbMATH DE number 2033335 (Why is no real title available?)
This page was built for publication: Accurate ensemble pruning with PL-bagging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1623764)