Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Активное обучение× | Градиентный бустинг× | |
|---|---|---|
| Область | Машинное обучение | Машинное обучение |
| Семейство | Machine learning | Machine learning |
| Год появления≠ | 2009 | 2001 |
| Автор метода≠ | Burr Settles | Friedman, J. H. |
| Тип≠ | Interactive supervised learning framework | Ensemble (sequential boosting of decision trees) |
| Основополагающий источник≠ | Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| Другие названия | Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| Связанные≠ | 2 | 5 |
| Сводка≠ | Active learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires. | Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost. |
| ScholarGateНабор данных ↗ |
|
|