ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Robusna slučajna šuma×Povećanje gradijenta×Izolacijska šuma×
PodručjeStrojno učenjeStrojno učenjeStrojno učenje
ObiteljMachine learningMachine learningMachine learning
Godina nastanka2000s–2010s20012008
TvoracVarious (extensions of Breiman 2001 Random Forest)Friedman, J. H.Liu, F.T., Ting, K.M. & Zhou, Z.-H.
VrstaRobust Ensemble (noise-tolerant bagging of decision trees)Ensemble (sequential boosting of decision trees)Unsupervised ensemble (random partitioning trees)
Temeljni izvorChen, 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 ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗
Drugi naziviRRF, noise-robust random forest, outlier-resistant random forest, robust ensemble forestGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
Srodne655
SažetakRobust 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.Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Robust Random Forest · Gradient Boosting · Isolation Forest. Preuzeto 2026-06-17 s https://scholargate.app/hr/compare