An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Explore this paper's citation graph
Summary
It is found that Bagging improves when probabilistic estimates in conjunction with no-pruning are used, as well as when the data was backfit, and that Arc-x4 behaves differently than AdaBoost if reweighting is used instead of resampling, indicating a fundamental difference.
- Type
- article
- Published
- 1999-07-01
- Cited by
- 2,829
- References
- 61
- Access
- Open access
- OpenAlex
- https://openalex.org/W2152761983
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:1088806
Keywords
Boosting (machine learning), AdaBoost, Artificial intelligence, Computer science, Machine learning
References
- Stacked generalization
- Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology
- Error-Based and Entropy-Based Discretization of Continuous Features
- Multi-Interval Discretization of Continuous-Valued Attributes for Constructing Incremental Decision Tree
- Estimating Probabilities: A Crucial Task in Machine Learning
- Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier
- Bias Plus Variance Decomposition for Zero-One Loss Functions
- Computational learning theory and natural learning systems
- Wrappers for performance enhancement and oblivious decision graphs
- Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
- Improving simple Bayes
- Option Decision Trees with Majority Votes
- The Effects of Training Set Size on Decision Tree Complexity
- Learning probabilistic relational concept descriptions
- An Analysis of Bayesian Classifiers
- A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection
- On Bias, Variance, 0/1—Loss, and the Curse-of-Dimensionality
- Data Mining Using MLC a Machine Learning Library in C++
- Boosting the margin: A new explanation for the effectiveness of voting methods
- A decision-theoretic generalization of on-line learning and an application to boosting
Cited by
- Simulation of Markovian models using bootstrap method
- Evaluating the C-section Rate of Different Physician Practices: Using Machine Learning to Model Standard Practice
- Logitboost of Simple Bayesian Classifier
- Sequence Learning from Data with Multiple Labels
- A Simple Algorithm for Learning Stable Machines
- A machine learning perspective on the development of clinical decision support systems utilizing mass spectra of blood samples
- An Online Ensemble of Classifiers
- Diversity-Based Weighting Schemes for Clustering Ensembles
- DELTA: A Distal Enhancer Locating Tool Based on AdaBoost Algorithm and Shape Features of Chromatin Modifications
- Neural networks improve brain cancer detection with Raman spectroscopy in the presence of operating room light artifacts
- A visual framework to accelerate knowledge discovery based on dimensionality reduction minimizing degradation of quality
- The Protein Structure Prediction Module of the Prot-Grid Information System
- A Study on Efficacy of Ensamble Methods for Classification Learning
- Development and application of soft computing and data mining techniques in hot dip galvanising
- Kernel methods for remote sensing data analysis
- Bagging KNN Classifiers using Different Expert Fusion Strategies
- Text Document Categorization by Machine Learning
- Heuristic subset clustering for consideration set analysis
- Unique classifier selection approach for bagging algorithm
- Improved Boosting Performance by Exclusion of Ambiguous Positive Examples
Related papers
- Advance and Prospects of AdaBoost Algorithm
- The Typical Algorithm of AdaBoost Series in Boosting Family
- Boosting algorithms for network intrusion detection: A comparative evaluation of Real AdaBoost, Gentle AdaBoost and Modest AdaBoost
- Supplemental Boosting and Cascaded ConvNet Based Transfer Learning Structure for Fast Traffic Sign Detection in Unknown Application Scenes
- MadaBoost: A Modification of AdaBoost
- Theoretical analysis of Boosting algorithm
- An Improved Adaboost Algorithm Based on Uncertain Functions
- AdaTree: Boosting a Weak Classifier into a Decision Tree