방법 비교

	Active Learning Voting Ensemble	배깅 (Bootstrap Aggregating)
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1992	1996
창시자	Seung, H. S., Opper, M., & Sompolinsky, H.	Breiman, L.
유형	Active learning with ensemble voting	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)
원전	Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory (COLT '92), pp. 287–294. ACM.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.
별칭	Query by Committee, QBC, active ensemble learning, committee-based active learning	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
관련	5	5
요약	Active Learning Voting Ensemble — formally known as Query by Committee — is an active learning strategy that trains a committee of diverse models and selects the unlabeled examples where the committee members disagree most for human annotation. By focusing labeling effort on the most informative points, it achieves high accuracy with far fewer labeled examples than passive 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.