ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Робастна случайна гора×Bagging (Bootstrap Aggregating)×Isolation Forest×
ОбластМашинно обучениеМашинно обучениеМашинно обучение
СемействоMachine learningMachine learningMachine learning
Година на възникване2000s–2010s19962008
СъздателVarious (extensions of Breiman 2001 Random Forest)Breiman, L.Liu, F.T., Ting, K.M. & Zhou, Z.-H.
ТипRobust Ensemble (noise-tolerant bagging of decision trees)Ensemble meta-algorithm (variance reduction via bootstrap aggregation)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. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. 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 forestBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorIsolation 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.Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.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. 3 Източници
  3. PUBLISHED
  1. v1
  2. 1 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Robust Random Forest · Bagging · Isolation Forest. Извлечено на 2026-06-17 от https://scholargate.app/bg/compare