ScholarGate
Assistente

Comparar métodos

Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.

DBSCAN×Isolation Forest Explicável×
ÁreaAprendizado de máquinaAprendizado de máquina
FamíliaMachine learningMachine learning
Ano de origem19962008 / 2017
Autor originalEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Liu, F. T., Ting, K. M., & Zhou, Z.-H. (Isolation Forest); Lundberg, S. M. & Lee, S.-I. (SHAP explainability layer)
TipoDensity-based clustering algorithmAnomaly detection with post-hoc explainability
Fonte seminalEster, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗
Outros nomesDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringXIF, Isolation Forest with SHAP, interpretable anomaly detection, explainable anomaly isolation
Relacionados35
ResumoDBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.Explainable Isolation Forest combines the Isolation Forest anomaly detection algorithm with post-hoc explainability tools — most commonly SHAP (SHapley Additive exPlanations) — to not only flag anomalous observations but also reveal which features drove each anomaly score. It bridges unsupervised anomaly detection with the interpretability demands of regulated and high-stakes domains.
ScholarGateConjunto de dados
  1. v1
  2. 1 Fontes
  3. PUBLISHED
  1. v1
  2. 2 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

ScholarGateComparar métodos: DBSCAN · Explainable Isolation Forest. Recuperado em 2026-06-18 de https://scholargate.app/pt/compare