방법 비교

	Robust Gradient Boosting	랜덤 포레스트
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2001	2001
창시자	Friedman, J. H. (with Huber loss from Huber, P. J.)	Breiman, L.
유형	Ensemble (boosted trees with robust loss)	Ensemble (bagging of decision trees)
원전	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.
별칭	gradient boosting with Huber loss, robust GBM, outlier-robust boosting, robust gradient-boosted trees	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	6	4
요약	Robust Gradient Boosting is gradient boosting trained with outlier-resistant loss functions — most commonly the Huber loss or quantile (pinball) loss — instead of squared-error loss. Proposed in Friedman's seminal 2001 paper, this variant produces predictions far less distorted by extreme values or contaminated labels, while retaining the full predictive power of gradient-boosted trees.	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.