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

	এনসেম্বল অ্যাক্টিভ লার্নিং	ভোটিং এনসেম্বল
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1992	1990s–2004
প্রবর্তক	Seung, H. S., Opper, M., & Sompolinsky, H.	Lam & Suen; Kuncheva, L. I. (systematic treatment)
ধরন	Ensemble-based active learning strategy	Ensemble (combination of multiple classifiers by vote)
মৌলিক উৎস	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.	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
অপর নাম	Query by Committee, QBC active learning, committee-based active learning, ensemble query strategy	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
সম্পর্কিত	5	5
সারসংক্ষেপ	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.	A voting ensemble trains several diverse classifiers independently and combines their predictions by a vote: hard voting picks the class chosen by the most models, while soft voting averages their class-probability estimates, optionally with per-model weights. The combination usually outperforms any individual member, and requires no additional training after the base models are fitted.