পদ্ধতির তুলনা করুন

	সক্রিয় শিখন ভোটিং এনসেম্বল	বুস্টিং
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1992	1990–1997
প্রবর্তক	Seung, H. S., Opper, M., & Sompolinsky, H.	Schapire, R. E.; Freund, Y.
ধরন	Active learning with ensemble voting	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 '92), 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 ensemble learning, committee-based active learning	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
সম্পর্কিত	5	6
সারসংক্ষেপ	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.	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.