Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| AdaBoost× | Дерево решений× | |
|---|---|---|
| Область | Машинное обучение | Машинное обучение |
| Семейство | Machine learning | Machine learning |
| Год появления≠ | 1997 | 1984 |
| Автор метода≠ | Freund, Y. & Schapire, R.E. | Breiman, Friedman, Olshen & Stone |
| Тип≠ | Ensemble (sequential boosting of weak learners) | Recursive partitioning (if-then rules) |
| Основополагающий источник≠ | 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 ↗ |
| Другие названия≠ | AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| Связанные | 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. |
| ScholarGateНабор данных ↗ |
|
|