방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 앙상블 아이솔레이션 포레스트× | 랜덤 포레스트× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2008 (base); ensemble variants 2010s–present | 2001 |
| 창시자≠ | Liu, F. T., Ting, K. M., Zhou, Z.-H. (base IF); ensemble extensions by multiple researchers | Breiman, L. |
| 유형≠ | Meta-ensemble anomaly detection | Ensemble (bagging of decision trees) |
| 원전≠ | 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. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 별칭 | EIF ensemble, multi-isolation-forest, isolation forest ensemble, ensemble anomaly detection with isolation trees | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 관련≠ | 5 | 4 |
| 요약≠ | 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|