ScholarGate
어시스턴트

방법 비교

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

능동 학습×배깅 (Bootstrap Aggregating)×
분야머신러닝머신러닝
계열Machine learningMachine learning
기원 연도20091996
창시자Burr SettlesBreiman, L.
유형Interactive supervised learning frameworkEnsemble meta-algorithm (variance reduction via bootstrap aggregation)
원전Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗
별칭Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif ÖğrenmeBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
관련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.Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.
ScholarGate데이터셋
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 3 출처
  3. PUBLISHED

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

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