Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| AdaBoost× | Дърво на решенията× | LightGBM× | |
|---|---|---|---|
| Област | Машинно обучение | Машинно обучение | Машинно обучение |
| Семейство | Machine learning | Machine learning | Machine learning |
| Година на възникване≠ | 1997 | 1984 | 2017 |
| Създател≠ | Freund, Y. & Schapire, R.E. | Breiman, Friedman, Olshen & Stone | Ke, G. et al. (Microsoft) |
| Тип≠ | Ensemble (sequential boosting of weak learners) | Recursive partitioning (if-then rules) | Gradient boosting decision tree ensemble |
| Основополагащ източник≠ | 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 ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. 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 ↗ |
| Други названия≠ | AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| Свързани | 5 | 5 | 5 |
| Резюме≠ | 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. | A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf. | 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Набор от данни ↗ |
|
|
|