Compara mètodes
Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.
| Ensemble Gradient Boosting× | XGBoost× | |
|---|---|---|
| Camp | Aprenentatge automàtic | Aprenentatge automàtic |
| Família | Machine learning | Machine learning |
| Any d'origen≠ | 2001 | 2016 |
| Autor original≠ | Friedman, J. H. | Chen, T. & Guestrin, C. |
| Tipus≠ | Ensemble (sequential boosting of decision trees) | Ensemble (gradient-boosted decision trees) |
| Font seminal≠ | Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Àlies≠ | Gradient Boosting Machine, GBM, Gradient Tree Boosting, Stochastic Gradient Boosting | XGBoost, extreme gradient boosting, scalable tree boosting |
| Relacionats≠ | 6 | 5 |
| Resum≠ | 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. | XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions. |
| ScholarGateConjunt de dades ↗ |
|
|