ScholarGate
Ассистент

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

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

Объяснимый одноклассовый SVM×Isolation Forest×
ОбластьМашинное обучениеМашинное обучение
СемействоMachine learningMachine learning
Год появления1999 (OCSVM); 2017–present (explainability integration)2008
Автор методаSchölkopf, B. et al. (OCSVM); explainability layer via Lundberg & Lee (SHAP, 2017) and related worksLiu, F.T., Ting, K.M. & Zhou, Z.-H.
ТипAnomaly/novelty detection with post-hoc or intrinsic explainabilityUnsupervised ensemble (random partitioning trees)
Основополагающий источникSchölkopf, B., Williamson, R., Smola, A., Shawe-Taylor, J., & Platt, J. (1999). Support vector method for novelty detection. Advances in Neural Information Processing Systems, 12, 582–588. link ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗
Другие названияXOC-SVM, Interpretable One-Class SVM, SHAP-augmented OCSVM, Explainable Novelty Detection SVMIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
Связанные45
СводкаExplainable One-Class SVM pairs the classic One-Class Support Vector Machine anomaly detector — which learns a tight boundary around normal data without requiring labeled anomalies — with post-hoc explainability methods such as SHAP or LIME to reveal which features drive each novelty or anomaly score, converting an opaque decision boundary into an auditable, feature-attributable signal.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Сравнение методов: Explainable One-Class SVM · Isolation Forest. Получено 2026-06-17 из https://scholargate.app/ru/compare