ScholarGate
Asistent

Porovnať metódy

Prezrite si vybrané metódy vedľa seba; riadky, ktoré sa líšia, sú zvýraznené.

Semi-Supervised Random Forest×Gradient Boosting×
OdborStrojové učenieStrojové učenie
RodinaMachine learningMachine learning
Rok vzniku20092001
TvorcaLeistner, C., Saffari, A., Santner, J., & Bischof, H.Friedman, J. H.
TypSemi-supervised ensemble classifierEnsemble (sequential boosting of decision trees)
Pôvodný zdrojLeistner, C., Saffari, A., Santner, J., & Bischof, H. (2009). Semi-supervised random forests. In Proceedings of the IEEE 12th International Conference on Computer Vision (ICCV), pp. 506–513. IEEE. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
Ďalšie názvySSL-RF, semi-supervised forest, label-propagation random forest, self-training random forestGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Príbuzné35
ZhrnutieSemi-supervised Random Forest (SSL-RF) extends the classic Random Forest by exploiting both labeled and unlabeled training examples. When labeling data is expensive or time-consuming, SSL-RF assigns tentative pseudo-labels to unlabeled observations through the forest itself, then retrains on the enriched dataset, progressively improving accuracy without requiring additional human annotation.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.
ScholarGateDátová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED

Prejsť na hľadanie Stiahnuť snímky

ScholarGatePorovnať metódy: Semi-supervised Random Forest · Gradient Boosting. Získané 2026-06-15 z https://scholargate.app/sk/compare