Sammenlign metoder
Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.
| Random Forest× | Stacking× | |
|---|---|---|
| Fagfelt | Maskinlæring | Maskinlæring |
| Familie | Machine learning | Machine learning |
| Opprinnelsesår≠ | 2001 | 1992 |
| Opphavsperson≠ | Breiman, L. | Wolpert, D.H. |
| Type≠ | Ensemble (bagging of decision trees) | Ensemble (heterogeneous meta-learning) |
| Opprinnelig kilde≠ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗ |
| Alias≠ | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner |
| Relaterte≠ | 4 | 5 |
| Sammendrag≠ | 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. | Stacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions. |
| ScholarGateDatasett ↗ |
|
|