Methoden vergelijken
Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.
| Robuuste LightGBM× | Gradient Boosting× | LightGBM× | |
|---|---|---|---|
| Vakgebied | Machine learning | Machine learning | Machine learning |
| Familie | Machine learning | Machine learning | Machine learning |
| Jaar van ontstaan≠ | 2017 (LightGBM); robust variants widely adopted 2018–present | 2001 | 2017 |
| Grondlegger≠ | Ke, G. et al. (LightGBM); robust objectives adapted from Friedman, J. H. | Friedman, J. H. | Ke, G. et al. (Microsoft) |
| Type≠ | Ensemble (gradient boosted decision trees with robust loss) | Ensemble (sequential boosting of decision trees) | Gradient boosting decision tree ensemble |
| Oorspronkelijke bron≠ | Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q., & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems, 30, 3146–3154. link ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154. link ↗ |
| Aliassen | Robust LGBM, LightGBM with Huber loss, outlier-resistant gradient boosting, robust gradient boosted trees | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| Verwant≠ | 6 | 5 | 5 |
| Samenvatting≠ | Robust LightGBM is a gradient boosting framework that pairs Microsoft's highly efficient LightGBM engine with outlier-resistant loss functions — most commonly Huber, quantile, or mean absolute error — so that predictions are not unduly distorted by extreme or erroneous observations. It retains LightGBM's speed and leaf-wise tree growth while providing resistance to heavy-tailed noise in the target variable. | 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. | LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy. |
| ScholarGateGegevensset ↗ |
|
|
|