So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Rừng cô lập tổ hợp× | Rừng ngẫu nhiên× | |
|---|---|---|
| Lĩnh vực | Học máy | Học máy |
| Họ | Machine learning | Machine learning |
| Năm ra đời≠ | 2008 (base); ensemble variants 2010s–present | 2001 |
| Người khởi xướng≠ | Liu, F. T., Ting, K. M., Zhou, Z.-H. (base IF); ensemble extensions by multiple researchers | Breiman, L. |
| Loại≠ | Meta-ensemble anomaly detection | Ensemble (bagging of decision trees) |
| Công trình gốc≠ | 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 ↗ |
| Tên gọi khác | 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 |
| Liên quan≠ | 5 | 4 |
| Tóm tắt≠ | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|