Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Aktywna nauka× | Gradient Boosting× | LightGBM× | |
|---|---|---|---|
| Dziedzina | Uczenie maszynowe | Uczenie maszynowe | Uczenie maszynowe |
| Rodzina | Machine learning | Machine learning | Machine learning |
| Rok powstania≠ | 2009 | 2001 | 2017 |
| Twórca≠ | Burr Settles | Friedman, J. H. | Ke, G. et al. (Microsoft) |
| Typ≠ | Interactive supervised learning framework | Ensemble (sequential boosting of decision trees) | Gradient boosting decision tree ensemble |
| Źródło pierwotne≠ | 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 ↗ | 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 ↗ |
| Inne nazwy | Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| Pokrewne≠ | 2 | 5 | 5 |
| Podsumowanie≠ | 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. | 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. |
| ScholarGateZbiór danych ↗ |
|
|
|