השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| הגברת גרדיאנט אנסמבל (Ensemble Gradient Boosting)× | AdaBoost× | LightGBM× | |
|---|---|---|---|
| תחום | למידת מכונה | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning | Machine learning |
| שנת המקור≠ | 2001 | 1997 | 2017 |
| הוגה השיטה≠ | Friedman, J. H. | Freund, Y. & Schapire, R.E. | Ke, G. et al. (Microsoft) |
| סוג≠ | Ensemble (sequential boosting of decision trees) | Ensemble (sequential boosting of weak learners) | Gradient boosting decision tree ensemble |
| מקור מכונן≠ | Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Freund, Y. & Schapire, R.E. (1997). A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences, 55(1), 119–139. 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 ↗ |
| כינויים≠ | Gradient Boosting Machine, GBM, Gradient Tree Boosting, Stochastic Gradient Boosting | AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| קשורות≠ | 6 | 5 | 5 |
| תקציר≠ | 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. | AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification. | 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. |
| ScholarGateמערך נתונים ↗ |
|
|
|