ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

جنگل تصادفی خود-نظارتی×انتشار برچسب (Label Propagation)×
حوزهیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learning
سال پیدایش2012–20222002
پدیدآورLefortier, D. et al.; Criminisi, A. et al. (semi-supervised RF lineage)Zhu, X. & Ghahramani, Z.
نوعSemi-supervised ensemble (self-supervised pretext task + RF)Graph-based semi-supervised classification
منبع بنیادینLefortier, 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 ↗
نام‌های دیگرSSL-RF, self-supervised RF, self-supervised ensemble forest, unsupervised random forest with self-labelingLP, label spreading, graph-based semi-supervised learning, harmonic label propagation
مرتبط63
خلاصهSelf-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.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 3 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Self-supervised Random Forest · Label Propagation. بازیابی‌شده در 2026-06-17 از https://scholargate.app/fa/compare