Popular Ensemble Methods: An Empirical Study
Explore this paper's citation graph
Summary
This work suggests that most of the gain in an ensemble's performance comes in the first few classifiers combined; however, relatively large gains can be seen up to 25 classifiers when Boosting decision trees.
- Type
- article
- Published
- 1999-07-01
- Cited by
- 3,134
- References
- 49
- Access
- Open access
- OpenAlex
- https://openalex.org/W2100805904
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:2594813
Keywords
Boosting (machine learning), Overfitting, Artificial intelligence, Decision tree, Computer science
References
- Stacked generalization
- Lowering Variance of Decisions by Using Artificial Neural Network Portfolios
- Ensembles as a Sequence of Classifiers
- An Empirical Comparison of ID3 and Back-propagation
- Combining the Predictions of Multiple Classifiers: Using Competitive Learning to Initialize Neural Networks
- Special Invited Paper-Additive logistic regression: A statistical view of boosting
- C4.5: Programs for Machine Learning (書評)
- Bias Plus Variance Decomposition for Zero-One Loss Functions
- An Empirical Evaluation of Bagging and Boosting
- Boosting the margin: A new explanation for the effectiveness of voting methods
- Combining forecasts: A review and annotated bibliography
- Hybrid system for protein secondary structure prediction.
- Optimal Linear Combinations of Neural Networks
- Neural Networks and the Bias/Variance Dilemma
- UCI Repository of machine learning databases
- The Strength of Weak Learnability
- Boosting in the Limit: Maximizing the Margin of Learned Ensembles
- Boosting Decision Trees
- Synergy of Clustering Multiple Back Propagation Networks
- Boosting Classifiers Regionally
Cited by
- Political Language in Economics
- Multiclass Adaboost Based on an Ensemble of Binary AdaBoosts
- Mitigation of Catastrophic Interference in Neural Networks and Ensembles using a Fixed Expansion Layer
- Identification de complexes protéine-protéine par combinaison de classifieurs. Application à Escherichia Coli
- Algorithms to Explore the Structure and Evolution of Biological Networks
- A Study on Efficacy of Ensamble Methods for Classification Learning
- Identifying Product Entities in text with Conditional Random Fields
- Feature set decomposition for decision trees
- Development and application of soft computing and data mining techniques in hot dip galvanising
- A Ranked Subspace Learning Method for Gene Expression Data Classification
- Text Document Categorization by Machine Learning
- Liberal or Conservative: Evaluation and Classification with Distribution as Ground Truth.
- Méthodes statistiques pour l'évaluation et la reconfiguration des réseaux de suivi de la qualité de l'eau de surface.
- Use of Shape Representation and Similarity in Classification of UXO in Magnetometry Data
- Empirical Study on Generalization of NN in Respect to Network Complexity
- Machine Learning Methods for High-Dimensional Imbalanced Biomedical Data
- Segmentación de lesiones de esclerosis múltiple en imágenes de RM de alto campo.
- Using Optimization-Based Classification Method for Massive Datasets
- Extended Trust-Tech Methodology For Nonlinear Optimization: Analyses, Methods And Applications
- Boosting SVM Classifiers with Logistic Regression
Related papers
- Attribute reduction-based boosting and its application
- Gradient Boosting Machine: A Survey
- A random subspace based conic functions ensemble classifier
- Accelerated proximal boosting
- Proximal boosting: Aggregating weak learners to minimize non-differentiable losses
- A Survey of Ensemble Learning: Concepts, Algorithms, Applications, and Prospects
- The impact of random samples in ensemble classifiers