ScholarGate
Asszisztens

Módszerek összehasonlítása

Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.

Magyarázható Izolációs Erdő×K-Nearest Neighbors magyarázhatóvá tétele (Explainable K-Nearest Neighbors)×HDBSCAN×
TudományterületGépi tanulásGépi tanulásGépi tanulás
MódszercsaládMachine learningMachine learningMachine learning
Keletkezés éve2008 / 20171967 (KNN); 2010s (explainability extensions)2013
MegalkotóLiu, F. T., Ting, K. M., & Zhou, Z.-H. (Isolation Forest); Lundberg, S. M. & Lee, S.-I. (SHAP explainability layer)Cover, T. & Hart, P. (KNN); XAI extensions by various authorsCampello, R. J. G. B.; Moulavi, D.; Sander, J.
TípusAnomaly detection with post-hoc explainabilityInstance-based learning with explainability layerHierarchical density-based clustering
AlapműLundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013). Density-Based Clustering Based on Hierarchical Density Estimates. In J. Pei et al. (Eds.), Advances in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science, vol. 7819 (pp. 160–172). Springer, Berlin, Heidelberg. DOI ↗
Alternatív nevekXIF, Isolation Forest with SHAP, interpretable anomaly detection, explainable anomaly isolationXKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest NeighborsHDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*
Kapcsolódó543
Összefoglaló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.Explainable K-Nearest Neighbors (XKNN) augments the classic KNN classifier or regressor with structured post-hoc or built-in explanation mechanisms, exposing which retrieved neighbors, which features, and which distance contributions drive each individual prediction — making the model's reasoning transparent and auditable for human decision-makers.HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) is a density-based clustering algorithm introduced by Campello, Moulavi, and Sander in 2013. It extends DBSCAN by building a full hierarchy of density-based clusters across all density scales and then extracting a stable flat partition, making it robust to datasets where cluster densities vary substantially across regions.
ScholarGateAdatkészlet
  1. v1
  2. 2 Források
  3. PUBLISHED
  1. v1
  2. 2 Források
  3. PUBLISHED
  1. v1
  2. 3 Források
  3. PUBLISHED

Ugrás a kereséshez Diák letöltése

ScholarGateMódszerek összehasonlítása: Explainable Isolation Forest · Explainable K-Nearest Neighbors · HDBSCAN. Letöltve 2026-06-18, forrás: https://scholargate.app/hu/compare