방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 정규화된 경사 부스팅× | 정규화된 결정 트리× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2001 (gradient boosting); 2016 (explicit L1/L2 regularization in XGBoost) | 1984 |
| 창시자≠ | Chen, T. & Guestrin, C. (building on Friedman, J. H.) | Breiman, L., Friedman, J., Olshen, R., & Stone, C. |
| 유형≠ | Regularized ensemble (additive tree model) | Supervised learning (regularized tree) |
| 원전≠ | 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 ↗ | Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and Regression Trees. Wadsworth. ISBN: 978-0-412-04841-8 |
| 별칭 | penalized gradient boosting, shrinkage-regularized boosting, XGBoost-style regularization, L1/L2 gradient boosting | pruned decision tree, cost-complexity pruned tree, penalized decision tree, constrained CART |
| 관련 | 6 | 6 |
| 요약≠ | 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. | A regularized decision tree is a decision tree model whose complexity is intentionally limited through pruning, depth constraints, or penalty terms to prevent overfitting. Rooted in Breiman et al.'s CART framework (1984), regularization converts the greedy tree-growing procedure into a bias-variance tradeoff, yielding models that generalize better to unseen data than fully-grown trees. |
| ScholarGate데이터셋 ↗ |
|
|