Comparar métodos

	Aprendizagem Ativa por Conjunto	Aprendizagem Ativa	Boosting	Aprendizado Semi-supervisionado
Área	Aprendizado de máquina	Aprendizado de máquina	Aprendizado de máquina	Aprendizado de máquina
Família	Machine learning	Machine learning	Machine learning	Machine learning
Ano de origem	1992	2009	1990–1997	1970s–2006 (formalized)
Autor original	Seung, H. S., Opper, M., & Sompolinsky, H.	Burr Settles	Schapire, R. E.; Freund, Y.	Vapnik, V. N. and others (community of researchers, 1970s–2000s)
Tipo	Ensemble-based active learning strategy	Interactive supervised learning framework	Sequential ensemble (iterative reweighting)	Learning paradigm
Fonte seminal	Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory (COLT 1992), pp. 287–294. ACM.	Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648.	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
Outros nomes	Query by Committee, QBC active learning, committee-based active learning, ensemble query strategy	Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	SSL, semi-supervised machine learning, transductive learning, label-efficient learning
Relacionados	5	2	6	5
Resumo	Ensemble Active Learning combines a committee of diverse models with an active learning loop to select the most informative unlabeled examples for labeling. Rooted in the Query by Committee framework introduced by Seung et al. (1992), it uses disagreement among committee members as a signal for uncertainty, reducing the number of labeled examples needed to achieve strong predictive performance.	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.	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.