ScholarGate
Ассистент

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

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Ансамбль Isolation Forest×Isolation Forest×
ОбластьМашинное обучениеМашинное обучение
СемействоMachine learningMachine learning
Год появления2008 (base); ensemble variants 2010s–present2008
Автор методаLiu, F. T., Ting, K. M., Zhou, Z.-H. (base IF); ensemble extensions by multiple researchersLiu, F.T., Ting, K.M. & Zhou, Z.-H.
ТипMeta-ensemble anomaly detectionUnsupervised ensemble (random partitioning trees)
Основополагающий источникLiu, F. T., Ting, K. M., & Zhou, Z.-H. (2008). Isolation Forest. In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), pp. 413–422. IEEE. DOI ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗
Другие названияEIF ensemble, multi-isolation-forest, isolation forest ensemble, ensemble anomaly detection with isolation treesIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
Связанные55
СводкаEnsemble Isolation Forest trains multiple Isolation Forest models — each with different random seeds, subsampling ratios, or contamination parameters — and combines their anomaly scores to produce a more stable, robust anomaly ranking. By averaging or aggregating across several independent isolation forests, the method reduces the variance inherent in any single forest and yields more reliable outlier detection on complex or high-dimensional data.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

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Ensemble Isolation Forest · Isolation Forest. Получено 2026-06-17 из https://scholargate.app/ru/compare