Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| AdaBoost× | LightGBM× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1997 | 2017 |
| Autorul original≠ | Freund, Y. & Schapire, R.E. | Ke, G. et al. (Microsoft) |
| Tip≠ | Ensemble (sequential boosting of weak learners) | Gradient boosting decision tree ensemble |
| Sursa seminală≠ | 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 ↗ |
| Denumiri alternative≠ | AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| Înrudite | 5 | 5 |
| Rezumat≠ | 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. |
| ScholarGateSet de date ↗ |
|
|