방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 능동 학습 LightGBM× | 랜덤 포레스트× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2017–present | 2001 |
| 창시자≠ | Settles, B. (active learning); Ke, G. et al. (LightGBM) | Breiman, L. |
| 유형≠ | Hybrid (active learning query strategy + gradient boosting classifier) | Ensemble (bagging of decision trees) |
| 원전≠ | Settles, B. (2012). Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6(1), 1–114. Morgan & Claypool. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 별칭 | AL-LightGBM, Active LightGBM, LightGBM active learning, AL-LGBM | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 관련≠ | 5 | 4 |
| 요약≠ | Active Learning LightGBM couples the query-efficient label-selection strategy of active learning with the speed and accuracy of LightGBM, a histogram-based gradient boosting framework. The model iteratively selects the most informative unlabeled instances for human annotation, retrains LightGBM on the growing labeled set, and converges to high accuracy with far fewer labeled examples than passive supervised learning. | 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데이터셋 ↗ |
|
|