השוואת שיטות

	למידת מכונה פעילה מבוססת אנסמבל	בוסטינג
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1992	1990–1997
הוגה השיטה	Seung, H. S., Opper, M., & Sompolinsky, H.	Schapire, R. E.; Freund, Y.
סוג	Ensemble-based active learning strategy	Sequential ensemble (iterative reweighting)
מקור מכונן	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.	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.
כינויים	Query by Committee, QBC active learning, committee-based active learning, ensemble query strategy	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
קשורות	5	6
תקציר	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.	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.