방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 랜덤 포레스트× | 정규화된 경사 부스팅× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2001 | 2001 (gradient boosting); 2016 (explicit L1/L2 regularization in XGBoost) |
| 창시자≠ | Breiman, L. | Chen, T. & Guestrin, C. (building on Friedman, J. H.) |
| 유형≠ | Ensemble (bagging of decision trees) | Regularized ensemble (additive tree model) |
| 원전≠ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A scalable tree boosting system. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794. DOI ↗ |
| 별칭 | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | penalized gradient boosting, shrinkage-regularized boosting, XGBoost-style regularization, L1/L2 gradient boosting |
| 관련≠ | 4 | 6 |
| 요약≠ | 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. | Regularized gradient boosting extends the classic additive tree ensemble (Friedman 2001) by embedding L1 and L2 penalty terms directly into the training objective, along with a complexity penalty on tree size. Popularized by XGBoost (Chen & Guestrin 2016), this framework reduces overfitting and improves generalization compared to unpenalized boosting, while retaining the method's characteristic accuracy on tabular data. |
| ScholarGate데이터셋 ↗ |
|
|