방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 자가 지도 결정 트리× | 랜덤 포레스트× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2015–present | 2001 |
| 창시자≠ | Multiple authors (active research area, 2010s–2020s) | Breiman, L. |
| 유형≠ | Self-supervised ensemble/single tree model | Ensemble (bagging of decision trees) |
| 원전≠ | Self-supervised learning. Wikipedia. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 별칭 | SSL decision tree, self-supervised tree classifier, pseudo-label decision tree, unsupervised-guided decision tree | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 관련≠ | 5 | 4 |
| 요약≠ | Self-supervised Decision Tree learning combines the interpretability of classical decision trees with the ability to exploit large quantities of unlabeled data through self-supervised pretext tasks. The model learns useful feature representations or node-split criteria from unlabeled samples before refining predictions on a small labeled set, bridging the gap between fully supervised trees and purely unsupervised clustering. | 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데이터셋 ↗ |
|
|