ScholarGate
어시스턴트

방법 비교

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

능동 학습 LightGBM×LightGBM×랜덤 포레스트×
분야머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learning
기원 연도2017–present20172001
창시자Settles, B. (active learning); Ke, G. et al. (LightGBM)Ke, G. et al. (Microsoft)Breiman, L.
유형Hybrid (active learning query strategy + gradient boosting classifier)Gradient boosting decision tree ensembleEnsemble (bagging of decision trees)
원전Settles, B. (2012). Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6(1), 1–114. Morgan & Claypool. DOI ↗Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
별칭AL-LightGBM, Active LightGBM, LightGBM active learning, AL-LGBMLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boostingRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련554
요약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.LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy.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. 1 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

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

ScholarGate방법 비교: Active Learning LightGBM · LightGBM · Random Forest. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare