Sammenlign metoder

	Aktiv læring stemmekomiteen	Bagging (Bootstrap Aggregating)	Semiveiledet læring
Fagfelt	Maskinlæring	Maskinlæring	Maskinlæring
Familie	Machine learning	Machine learning	Machine learning
Opprinnelsesår	1992	1996	1970s–2006 (formalized)
Opphavsperson	Seung, H. S., Opper, M., & Sompolinsky, H.	Breiman, L.	Vapnik, V. N. and others (community of researchers, 1970s–2000s)
Type	Active learning with ensemble voting	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Learning paradigm
Opprinnelig kilde	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.	Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
Alias	Query by Committee, QBC, active ensemble learning, committee-based active learning	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	SSL, semi-supervised machine learning, transductive learning, label-efficient learning
Relaterte	5	5	5
Sammendrag	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.	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.