Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Ενίσχυση Κλίσης (Gradient Boosting)× | Παλινδρόμηση Ποσοστημορίων× | |
|---|---|---|
| Πεδίο≠ | Μηχανική Μάθηση | Οικονομετρία |
| Οικογένεια≠ | 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Σύνολο δεδομένων ↗ |
|
|