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×Náhodný les×
OdborStrojové učenieStrojové učenie
RodinaMachine learningMachine learning
Rok vzniku20092001
TvorcaLeistner, C., Saffari, A., Santner, J., & Bischof, H.Breiman, L.
TypSemi-supervised ensemble classifierEnsemble (bagging 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 ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Ďalšie názvySSL-RF, semi-supervised forest, label-propagation random forest, self-training random forestRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Príbuzné34
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.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.
ScholarGateDátová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Prejsť na hľadanie Stiahnuť snímky

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