ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

준지도학습 랜덤 포레스트×레이블 전파×랜덤 포레스트×
분야머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learning
기원 연도200920022001
창시자Leistner, C., Saffari, A., Santner, J., & Bischof, H.Zhu, X. & Ghahramani, Z.Breiman, L.
유형Semi-supervised ensemble classifierGraph-based semi-supervised classificationEnsemble (bagging of decision trees)
원전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 ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
별칭SSL-RF, semi-supervised forest, label-propagation random forest, self-training random forestLP, label spreading, graph-based semi-supervised learning, harmonic label propagationRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련334
요약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.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데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 3 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Semi-supervised Random Forest · Label Propagation · Random Forest. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare