방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 그래디언트 부스팅× | 조건부 분위수 회귀× | |
|---|---|---|
| 분야≠ | 머신러닝 | 계량경제학 |
| 계열≠ | Machine learning | Regression model |
| 기원 연도≠ | 2001 | 1978 |
| 창시자≠ | Friedman, J. H. | Koenker & Bassett |
| 유형≠ | Ensemble (sequential boosting of decision trees) | Conditional quantile regression |
| 원전≠ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Koenker, R. & Bassett, G., Jr. (1978). Regression Quantiles. Econometrica, 46(1), 33-50. DOI ↗ |
| 별칭≠ | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | conditional quantile regression, regression quantiles, Kantil Regresyon |
| 관련 | 5 | 5 |
| 요약≠ | 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. | Quantile regression models conditional quantiles of an outcome - the median, the 25th or 75th percentile, and so on - rather than the conditional mean that OLS targets. Introduced by Koenker and Bassett in 1978, it reveals how predictors act across the whole distribution, including its tails. |
| ScholarGate데이터셋 ↗ |
|
|