ScholarGate
어시스턴트

방법 비교

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

능동 학습×XGBoost×
분야머신러닝머신러닝
계열Machine learningMachine learning
기원 연도20092016
창시자Burr SettlesChen, T. & Guestrin, C.
유형Interactive supervised learning frameworkEnsemble (gradient-boosted decision trees)
원전Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
별칭Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif ÖğrenmeXGBoost, extreme gradient boosting, scalable tree boosting
관련25
요약Active learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires.XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.
ScholarGate데이터셋
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

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

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