ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

יער אקראי חסין×עץ החלטה×יער בידוד×
תחוםלמידת מכונהלמידת מכונהלמידת מכונה
משפחהMachine learningMachine learningMachine learning
שנת המקור2000s–2010s19842008
הוגה השיטהVarious (extensions of Breiman 2001 Random Forest)Breiman, Friedman, Olshen & StoneLiu, F.T., Ting, K.M. & Zhou, Z.-H.
סוגRobust Ensemble (noise-tolerant bagging of decision trees)Recursive partitioning (if-then rules)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 ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗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 forestKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
קשורות655
תקציר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.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.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מערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 1 מקורות
  3. PUBLISHED
  1. v1
  2. 1 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Robust Random Forest · Decision Tree · Isolation Forest. אוחזר בתאריך 2026-06-18 מתוך https://scholargate.app/he/compare