ScholarGate
সহকারী

পদ্ধতির তুলনা করুন

নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।

ব্যাখ্যামূলক ডিবিস্ক্যান×ডিবিস্ক্যান×ব্যাখ্যাযোগ্য আইসোলেশন ফরেস্ট×HDBSCAN×
ক্ষেত্রযন্ত্র শিখনযন্ত্র শিখনযন্ত্র শিখনযন্ত্র শিখন
পরিবারMachine learningMachine learningMachine learningMachine learning
উদ্ভবের বছর1996 (DBSCAN); 2010s (XAI integration)19962008 / 20172013
প্রবর্তকEster, M. et al. (DBSCAN); XAI layer via Lundberg & Lee (SHAP)Ester, 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)Campello, R. J. G. B.; Moulavi, D.; Sander, J.
ধরনUnsupervised clustering with post-hoc interpretabilityDensity-based clustering algorithmAnomaly detection with post-hoc explainabilityHierarchical density-based clustering
মৌলিক উৎসEster, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), 226–231. AAAI Press. link ↗Ester, 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 ↗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 ↗
অপর নামXAI-DBSCAN, interpretable DBSCAN, transparent density clustering, DBSCAN with post-hoc explanationDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringXIF, Isolation Forest with SHAP, interpretable anomaly detection, explainable anomaly isolationHDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*
সম্পর্কিত5353
সারসংক্ষেপExplainable DBSCAN pairs the DBSCAN density-based clustering algorithm with post-hoc interpretability methods — most commonly SHAP values or local surrogate models — to reveal which input features drive the algorithm's cluster and noise assignments. It enables analysts to understand why specific points were grouped together or flagged as outliers, bridging the gap between powerful density-based partitioning and human-readable explanation.DBSCAN 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.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.
ScholarGateডেটাসেট
  1. v1
  2. 2 উৎস
  3. PUBLISHED
  1. v1
  2. 1 উৎস
  3. PUBLISHED
  1. v1
  2. 2 উৎস
  3. PUBLISHED
  1. v1
  2. 3 উৎস
  3. PUBLISHED

অনুসন্ধানে যান স্লাইড ডাউনলোড করুন

ScholarGateপদ্ধতির তুলনা করুন: Explainable DBSCAN · DBSCAN · Explainable Isolation Forest · HDBSCAN. 2026-06-18 তারিখে সংগৃহীত, উৎস: https://scholargate.app/bn/compare