방법 비교

	앙상블 능동 학습	랜덤 포레스트
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1992	2001
창시자	Seung, H. S., Opper, M., & Sompolinsky, H.	Breiman, L.
유형	Ensemble-based active learning strategy	Ensemble (bagging of decision trees)
원전	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.
별칭	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
관련	5	4
요약	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.