Usporedite metode

	Objašnjivi HDBSCAN	Objašnjivi K-Means
Područje	Strojno učenje	Strojno učenje
Obitelj	Machine learning	Machine learning
Godina nastanka	2017–2020	2020
Tvorac	McInnes, L.; Healy, J. (HDBSCAN); Lundberg & Lee (SHAP-based explanation)	Dasgupta, S.; Moshkovitz, M.; Frost, N.; Rashtchian, C.
Vrsta	Explainable clustering	Explainable unsupervised clustering algorithm
Temeljni izvor	McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205.	Dasgupta, S., Frost, N., Moshkovitz, M., & Rashtchian, C. (2020). Explainability of k-Means Clustering. Proceedings of the 37th International Conference on Machine Learning (ICML), PMLR 119.
Drugi nazivi	XAI-HDBSCAN, Interpretable HDBSCAN, Explainable Hierarchical DBSCAN, HDBSCAN with XAI	ExKMC, interpretable k-means, decision-tree k-means, explainable clustering
Srodne	6	5
Sažetak	Explainable HDBSCAN combines the hierarchical density-based clustering algorithm HDBSCAN with post-hoc explainability methods — primarily SHAP — to reveal which input features drive cluster membership and separation. It retains HDBSCAN's ability to find clusters of varying shape and density while adding a principled, auditable explanation layer.	Explainable K-Means is a post-hoc and in-model interpretability approach to standard K-Means clustering that replaces or approximates cluster assignments with a small axis-aligned decision tree. Each leaf of the tree corresponds to one cluster, and every data point is assigned to a cluster by following a simple sequence of threshold rules on individual features — making cluster membership fully transparent and human-readable.