Porovnať metódy

	Gradient Boosting	Náhodný les
Odbor	Strojové učenie	Strojové učenie
Rodina	Machine learning	Machine learning
Rok vzniku	2001	2001
Tvorca	Friedman, J. H.	Breiman, L.
Typ	Ensemble (sequential boosting of decision trees)	Ensemble (bagging of decision trees)
Pôvodný zdroj	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Ďalšie názvy	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Príbuzné	5	4
Zhrnutie	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.	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.