ScholarGate
Pembantu

Bandingkan kaedah

Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.

Hutan Isolasi Robust×Isolation Forest×
BidangPembelajaran MesinPembelajaran Mesin
KeluargaMachine learningMachine learning
Tahun asal2008–20192008
PengasasLiu, F. T., Ting, K. M., Zhou, Z.-H. (base); robust extensions by multiple authorsLiu, F.T., Ting, K.M. & Zhou, Z.-H.
JenisRobust ensemble anomaly detectionUnsupervised ensemble (random partitioning trees)
Sumber perintisLiu, F. T., Ting, K. M., & Zhou, Z.-H. (2008). Isolation Forest. In Proceedings of the IEEE International Conference on Data Mining (ICDM), pp. 413–422. IEEE. DOI ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗
AliasRobust iForest, noise-robust isolation forest, contamination-robust isolation forest, robust anomaly isolationIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
Berkaitan55
RingkasanRobust Isolation Forest extends the classic Isolation Forest anomaly detector with strategies that reduce sensitivity to data contamination, masking effects, and biased random splits. By incorporating robustness mechanisms — such as improved subsampling, re-weighting of suspicious regions, or bias-corrected splitting — it achieves more reliable anomaly scores when the training data itself contains a non-trivial fraction of anomalies or when specific feature distributions cause standard iForest to produce unreliable path lengths.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.
ScholarGateSet data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 1 Sumber
  3. PUBLISHED

Pergi ke carian Muat turun slaid

ScholarGateBandingkan kaedah: Robust Isolation forest · Isolation Forest. Dicapai 2026-06-17 daripada https://scholargate.app/ms/compare