Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| XGBoost× | Random Forest× | |
|---|---|---|
| Dziedzina | Uczenie maszynowe | Uczenie maszynowe |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 2016 | 2001 |
| Twórca≠ | Chen, T. & Guestrin, C. | Breiman, L. |
| Typ≠ | Ensemble (gradient-boosted decision trees) | Ensemble (bagging of decision trees) |
| Źródło pierwotne≠ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Inne nazwy≠ | XGBoost, extreme gradient boosting, scalable tree boosting | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Pokrewne≠ | 5 | 4 |
| Podsumowanie≠ | XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions. | 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. |
| ScholarGateZbiór danych ↗ |
|
|