השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| יער אקראי חסין× | יער בידוד× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 2000s–2010s | 2008 |
| הוגה השיטה≠ | Various (extensions of Breiman 2001 Random Forest) | Liu, F.T., Ting, K.M. & Zhou, Z.-H. |
| סוג≠ | Robust Ensemble (noise-tolerant bagging of decision trees) | Unsupervised ensemble (random partitioning trees) |
| מקור מכונן≠ | Chen, S., & Guestrin, C. (2019). Robust Random Forest. In Proceedings of the 36th International Conference on Machine Learning (ICML). Also see: Gao, W., & Zhou, Z.-H. (2013). On the Doubt about Margin Explanation of Boosting. Artificial Intelligence, 203, 1–18. link ↗ | Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗ |
| כינויים≠ | RRF, noise-robust random forest, outlier-resistant random forest, robust ensemble forest | Isolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection |
| קשורות≠ | 6 | 5 |
| תקציר≠ | Robust Random Forest extends the standard Random Forest ensemble by incorporating mechanisms that reduce the influence of outliers, label noise, and corrupted observations. Rather than treating all training instances equally, it applies weighting or filtering strategies so that noisy or anomalous samples contribute less to individual tree splits, yielding predictions that remain reliable even when data quality is imperfect. | Isolation Forest is an unsupervised machine-learning method for anomaly and outlier detection, introduced by Liu, Ting and Zhou in 2008, that isolates anomalies through random partitioning of the data. It works without any labelled anomaly data and scales to high-dimensional datasets. |
| ScholarGateמערך נתונים ↗ |
|
|