방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 준지도학습 랜덤 포레스트× | 레이블 전파× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2009 | 2002 |
| 창시자≠ | Leistner, C., Saffari, A., Santner, J., & Bischof, H. | Zhu, X. & Ghahramani, Z. |
| 유형≠ | Semi-supervised ensemble classifier | Graph-based semi-supervised classification |
| 원전≠ | Leistner, 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 ↗ | 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, semi-supervised forest, label-propagation random forest, self-training random forest | LP, label spreading, graph-based semi-supervised learning, harmonic label propagation |
| 관련 | 3 | 3 |
| 요약≠ | Semi-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. | 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데이터셋 ↗ |
|
|