Algorithm-Agnostic Explainability for Unsupervised Clustering
Not on the map. Why?
Abstract (arXiv)
Supervised machine learning explainability has developed rapidly in recent years. However, clustering explainability has lagged behind. Here, we demonstrate the first adaptation of model-agnostic explainability methods to explain unsupervised clustering. We present two novel "algorithm-agnostic" explainability methods - global permutation percent change (G2PC) and local perturbation percent change (L2PC) - that identify feature importance globally to a clustering algorithm and locally to the clustering of individual samples. The methods are (1) easy to implement and (2) broadly applicable across clustering algorithms, which could make them highly impactful. We demonstrate the utility of the methods for explaining five popular clustering methods on low-dimensional synthetic datasets and on high-dimensional functional network connectivity data extracted from a resting-state functional magnetic resonance imaging dataset of 151 individuals with schizophrenia and 160 controls. Our results are consistent with existing literature while also shedding new light on how changes in brain connectivity may lead to schizophrenia symptoms. We further compare the explanations from our methods to an interpretable classifier and find them to be highly similar. Our proposed methods robustly explain multiple clustering algorithms and could facilitate new insights into many applications. We hope this study will greatly accelerate the development of the field of clustering explainability.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 6 of its 50 references that are in the map. First posted on arXiv 17 May 2021.
Builds on
6 of 50 references.
References · 6
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2017Interpretable Explanations of Black Boxes by Meaningful Perturbationcited by 611
- 2014Understanding Random Forests: From Theory to Practicecited by 57
- 2020ExKMC: Expanding Explainable k-Means Clusteringcited by 31
- 2018Interpretable Clustering via Optimal Treescited by 10
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 1.
4 papers.
- 2024Counterfactual Explanations for Clustering Modelscited by 1
- 2022Algorithm-Agnostic Interpretations for Clusteringcited by 0
- 2023Position Paper: Bridging the Gap Between Machine Learning and Sensitivity Analysiscited by 0
- 2025Explainable Evidential Clusteringcited by 0
- 2025Explainable Evidential Clustering16 Jul 2025
- 2024Counterfactual Explanations for Clustering Models19 Sep 2024
- 2023Position Paper: Bridging the Gap Between Machine Learning and Sensitivity Analysis20 Dec 2023
- 2022Algorithm-Agnostic Interpretations for Clustering21 Sep 2022