ScholarGate
Asistent

Porovnať metódy

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

Náhodný les so sebou samým riadeným učením×Propagácia štítkov×
OdborStrojové učenieStrojové učenie
RodinaMachine learningMachine learning
Rok vzniku2012–20222002
TvorcaLefortier, D. et al.; Criminisi, A. et al. (semi-supervised RF lineage)Zhu, X. & Ghahramani, Z.
TypSemi-supervised ensemble (self-supervised pretext task + RF)Graph-based semi-supervised classification
Pôvodný zdrojLefortier, D., Chitta, K., & Agrawal, P. (2022). Self-supervised random forests. arXiv:2204.01430. link ↗Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗
Ďalšie názvySSL-RF, self-supervised RF, self-supervised ensemble forest, unsupervised random forest with self-labelingLP, label spreading, graph-based semi-supervised learning, harmonic label propagation
Príbuzné63
ZhrnutieSelf-supervised Random Forest (SSL-RF) extends the classic random forest to settings where labeled examples are scarce. The forest is first trained using automatically generated pseudo-labels derived from a self-supervised pretext task — such as predicting data transformations or masked features — and then refined on whatever true labels are available, marrying the label-efficiency of self-supervised learning with the robustness of ensemble trees.Label Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data.
ScholarGateDátová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 3 Zdroje
  3. PUBLISHED

Prejsť na hľadanie Stiahnuť snímky

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