Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| XGBoost Semi-supervisionado× | Gradient Boosting× | Random Forest× | |
|---|---|---|---|
| Área | Aprendizado de máquina | Aprendizado de máquina | Aprendizado de máquina |
| Família | Machine learning | Machine learning | Machine learning |
| Ano de origem≠ | 2016–2018 | 2001 | 2001 |
| Autor original≠ | Chen, T. & Guestrin, C. (XGBoost); semi-supervised extension by multiple authors | Friedman, J. H. | Breiman, L. |
| Tipo≠ | Ensemble (semi-supervised gradient boosting) | Ensemble (sequential boosting of decision trees) | Ensemble (bagging of decision trees) |
| Fonte seminal≠ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Outros nomes | SS-XGBoost, semi-supervised gradient boosting, pseudo-label XGBoost, label-propagation XGBoost | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Relacionados≠ | 4 | 5 | 4 |
| Resumo≠ | Semi-supervised XGBoost extends the XGBoost gradient boosting framework to settings where only a fraction of training examples carry labels. By iteratively generating pseudo-labels for unlabeled data and retraining on the expanded set, the method extracts signal from unlabeled observations, improving generalization when labeled data are scarce. | 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. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateConjunto de dados ↗ |
|
|
|