방법 비교

	Active Learning Voting Ensemble	능동 학습	배깅 (Bootstrap Aggregating)	부스팅	준지도 학습
분야	머신러닝	머신러닝	머신러닝	머신러닝	머신러닝
계열	Machine learning	Machine learning	Machine learning	Machine learning	Machine learning
기원 연도	1992	2009	1996	1990–1997	1970s–2006 (formalized)
창시자	Seung, H. S., Opper, M., & Sompolinsky, H.	Burr Settles	Breiman, L.	Schapire, R. E.; Freund, Y.	Vapnik, V. N. and others (community of researchers, 1970s–2000s)
유형	Active learning with ensemble voting	Interactive supervised learning framework	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Sequential ensemble (iterative reweighting)	Learning paradigm
원전	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.	Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139.	Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
별칭	Query by Committee, QBC, active ensemble learning, committee-based active learning	Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	SSL, semi-supervised machine learning, transductive learning, label-efficient learning
관련	5	2	5	6	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.	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.	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.	Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained.