방법 비교

	앙상블 아이솔레이션 포레스트	Voting Ensemble
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2008 (base); ensemble variants 2010s–present	1990s–2004
창시자	Liu, F. T., Ting, K. M., Zhou, Z.-H. (base IF); ensemble extensions by multiple researchers	Lam & Suen; Kuncheva, L. I. (systematic treatment)
유형	Meta-ensemble anomaly detection	Ensemble (combination of multiple classifiers by vote)
원전	Liu, F. T., Ting, K. M., & Zhou, Z.-H. (2008). Isolation Forest. In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), pp. 413–422. IEEE.	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
별칭	EIF ensemble, multi-isolation-forest, isolation forest ensemble, ensemble anomaly detection with isolation trees	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
관련	5	5
요약	Ensemble Isolation Forest trains multiple Isolation Forest models — each with different random seeds, subsampling ratios, or contamination parameters — and combines their anomaly scores to produce a more stable, robust anomaly ranking. By averaging or aggregating across several independent isolation forests, the method reduces the variance inherent in any single forest and yields more reliable outlier detection on complex or high-dimensional data.	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.