手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| 自己教師ありランダムフォレスト× | ランダムフォレスト× | |
|---|---|---|
| 分野 | 機械学習 | 機械学習 |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 2012–2022 | 2001 |
| 提唱者≠ | Lefortier, D. et al.; Criminisi, A. et al. (semi-supervised RF lineage) | Breiman, L. |
| 種類≠ | Semi-supervised ensemble (self-supervised pretext task + RF) | Ensemble (bagging of decision trees) |
| 原典≠ | Lefortier, D., Chitta, K., & Agrawal, P. (2022). Self-supervised random forests. arXiv:2204.01430. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 別名 | SSL-RF, self-supervised RF, self-supervised ensemble forest, unsupervised random forest with self-labeling | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 関連≠ | 6 | 4 |
| 概要≠ | 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. | 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. |
| ScholarGateデータセット ↗ |
|
|