Methoden vergelijken
Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.
| Bagging (Bootstrap Aggregating)× | Online Boosting× | Random Forest× | |
|---|---|---|---|
| Vakgebied | Machine learning | Machine learning | Machine learning |
| Familie | Machine learning | Machine learning | Machine learning |
| Jaar van ontstaan≠ | 1996 | 2001 | 2001 |
| Grondlegger≠ | Breiman, L. | Oza, N. C. & Russell, S. | Breiman, L. |
| Type≠ | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Online ensemble (incremental boosting) | Ensemble (bagging of decision trees) |
| Oorspronkelijke bron≠ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Oza, N. C., & Russell, S. (2001). Online Bagging and Boosting. In Artificial Intelligence and Statistics 2001 (pp. 105–112). Morgan Kaufmann. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Aliassen≠ | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | streaming boosting, incremental boosting, online AdaBoost, online ensemble boosting | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Verwant≠ | 5 | 6 | 4 |
| Samenvatting≠ | Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner. | Online Boosting adapts the classical boosting framework to data streams, updating an ensemble of weak learners one example at a time without storing the full dataset. The Oza-Russell formulation approximates AdaBoost's reweighting using Poisson-sampled instance counts, enabling accurate, adaptive classification in real-time or resource-constrained environments. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateGegevensset ↗ |
|
|
|