Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Gradient Boosting de Ansamblu× | LightGBM× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2001 | 2017 |
| Autorul original≠ | Friedman, J. H. | Ke, G. et al. (Microsoft) |
| Tip≠ | Ensemble (sequential boosting of decision trees) | Gradient boosting decision tree ensemble |
| Sursa seminală≠ | 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 ↗ |
| Denumiri alternative | Gradient Boosting Machine, GBM, Gradient Tree Boosting, Stochastic Gradient Boosting | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| Înrudite≠ | 6 | 5 |
| Rezumat≠ | Gradient Boosting is an ensemble method introduced by Jerome Friedman in 2001 that builds a strong predictive model by sequentially adding shallow decision trees, each correcting the errors of the previous ensemble. By framing the problem as gradient descent in function space, it achieves state-of-the-art accuracy on classification, regression, and ranking tasks across tabular data. | 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. |
| ScholarGateSet de date ↗ |
|
|