Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Ensemble Decision Tree× | Boosting× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1996–2000 | 1990–1997 |
| Upphovsperson≠ | Breiman, L.; Dietterich, T. G. | Schapire, R. E.; Freund, Y. |
| Typ≠ | Ensemble (multiple decision trees combined) | Sequential ensemble (iterative reweighting) |
| Ursprungskälla≠ | Dietterich, T. G. (2000). Ensemble methods in machine learning. In Multiple Classifier Systems, Lecture Notes in Computer Science, vol. 1857, pp. 1–15. Springer, Berlin, Heidelberg. DOI ↗ | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ |
| Alias | decision tree ensemble, ensemble of decision trees, combined decision trees, multiple classifier system (decision trees) | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble |
| Närliggande | 6 | 6 |
| Sammanfattning≠ | Ensemble Decision Tree methods train multiple decision trees and combine their outputs to produce predictions that are more accurate and stable than any single tree. Covering strategies such as bagging, random subspacing, and voting, they are among the most effective off-the-shelf techniques for tabular classification and regression tasks. | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. |
| ScholarGateDatamängd ↗ |
|
|