Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Активное обучение с LightGBM× | Градиентный бустинг× | LightGBM× | |
|---|---|---|---|
| Область | Машинное обучение | Машинное обучение | Машинное обучение |
| Семейство | Machine learning | Machine learning | Machine learning |
| Год появления≠ | 2017–present | 2001 | 2017 |
| Автор метода≠ | Settles, B. (active learning); Ke, G. et al. (LightGBM) | Friedman, J. H. | Ke, G. et al. (Microsoft) |
| Тип≠ | Hybrid (active learning query strategy + gradient boosting classifier) | Ensemble (sequential boosting of decision trees) | Gradient boosting decision tree ensemble |
| Основополагающий источник≠ | Settles, B. (2012). Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6(1), 1–114. Morgan & Claypool. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. 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 ↗ |
| Другие названия | AL-LightGBM, Active LightGBM, LightGBM active learning, AL-LGBM | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| Связанные | 5 | 5 | 5 |
| Сводка≠ | Active Learning LightGBM couples the query-efficient label-selection strategy of active learning with the speed and accuracy of LightGBM, a histogram-based gradient boosting framework. The model iteratively selects the most informative unlabeled instances for human annotation, retrains LightGBM on the growing labeled set, and converges to high accuracy with far fewer labeled examples than passive supervised learning. | 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. | 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Набор данных ↗ |
|
|
|