Sammenlign metoder

	Ensemble Active Learning	Random Forest
Fagområde	Maskinlæring	Maskinlæring
Familie	Machine learning	Machine learning
Oprindelsesår	1992	2001
Ophavsperson	Seung, H. S., Opper, M., & Sompolinsky, H.	Breiman, L.
Type	Ensemble-based active learning strategy	Ensemble (bagging of decision trees)
Oprindelig kilde	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.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Aliasser	Query by Committee, QBC active learning, committee-based active learning, ensemble query strategy	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Relaterede	5	4
Resumé	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.