Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Statistical Instance-Based Pruning in Ensembles of Independent Classifiers

Published: 01 February 2009 Publication History

Abstract

The global prediction of a homogeneous ensemble of classifiers generated in independent applications of a randomized learning algorithm on a fixed training set is analyzed within a Bayesian framework. Assuming that majority voting is used, it is possible to estimate with a given confidence level the prediction of the complete ensemble by querying only a subset of classifiers. For a particular instance that needs to be classified, the polling of ensemble classifiers can be halted when the probability that the predicted class will not change when taking into account the remaining votes is above the specified confidence level. Experiments on a collection of benchmark classification problems using representative parallel ensembles, such as bagging and random forests, confirm the validity of the analysis and demonstrate the effectiveness of the instance-based ensemble pruning method proposed.

Cited By

View all
  • (2024)Learn Together Stop Apart: An Inclusive Approach to Ensemble PruningProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3672018(1166-1176)Online publication date: 25-Aug-2024
  • (2022)Algorithm selection on a meta levelMachine Language10.1007/s10994-022-06161-4112:4(1253-1286)Online publication date: 18-Apr-2022
  • (2022)A stochastic approach to handle resource constraints as knapsack problems in ensemble pruningMachine Language10.1007/s10994-021-06109-0111:4(1551-1595)Online publication date: 1-Apr-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence  Volume 31, Issue 2
February 2009
198 pages

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 February 2009

Author Tags

  1. Ensemble learning
  2. Polya urn
  3. Polya urn.
  4. bagging
  5. ensemble pruning
  6. instance-based pruning
  7. random forests

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Learn Together Stop Apart: An Inclusive Approach to Ensemble PruningProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3672018(1166-1176)Online publication date: 25-Aug-2024
  • (2022)Algorithm selection on a meta levelMachine Language10.1007/s10994-022-06161-4112:4(1253-1286)Online publication date: 18-Apr-2022
  • (2022)A stochastic approach to handle resource constraints as knapsack problems in ensemble pruningMachine Language10.1007/s10994-021-06109-0111:4(1551-1595)Online publication date: 1-Apr-2022
  • (2022)A Survey on ensemble learning under the era of deep learningArtificial Intelligence Review10.1007/s10462-022-10283-556:6(5545-5589)Online publication date: 2-Nov-2022
  • (2021)Quit When You Can: Efficient Evaluation of Ensembles by Optimized OrderingACM Journal on Emerging Technologies in Computing Systems10.1145/345120917:4(1-20)Online publication date: 14-Jul-2021
  • (2021)Local minima found in the subparameter space can be effective for ensembles of deep convolutional neural networksPattern Recognition10.1016/j.patcog.2020.107582109:COnline publication date: 1-Jan-2021
  • (2020)Born-again tree ensemblesProceedings of the 37th International Conference on Machine Learning10.5555/3524938.3525841(9743-9753)Online publication date: 13-Jul-2020
  • (2020)A survey on ensemble learningFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-019-8208-z14:2(241-258)Online publication date: 1-Apr-2020
  • (2019)Margin-Based Pareto Ensemble PruningComputational Intelligence and Neuroscience10.1155/2019/75608722019Online publication date: 3-Jun-2019
  • (2018)EMnGA: Entropy Measure and Genetic Algorithms Based Method for Heterogeneous Ensembles SelectionIntelligent Data Engineering and Automated Learning – IDEAL 201810.1007/978-3-030-03496-2_30(271-279)Online publication date: 21-Nov-2018
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media