Counterfactuals for Feature-Weighted Clustering
Not on the map. Why?
Abstract (arXiv)
Counterfactual explanations provide local, interpretable insight by identifying changes to an input that would alter its assigned outcome. Although well established in supervised learning, their extension to clustering is less direct, since cluster assignments are unlabeled and governed by the geometry of the partition. This paper introduces VoICE, a Voronoi-Induced Counterfactual Explainability framework for feature-weighted k-means clustering. Rather than treating cluster change as a crossing of a single pairwise centroid boundary, VoICE formulates counterfactual generation as projection onto the full weighted Voronoi region of a target cluster, incorporating feature weights directly into both the clustering geometry and the counterfactual objective to yield least-cost and parsimonious explanations under actionability constraints. Target regions are further intersected with data-derived bounds and homothetically contracted towards their centroids, limiting extrapolation and boundary sensitivity. VoICE consistently produces valid target-cluster membership, across several benchmark datasets, where the leading pairwise baseline does not.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 37 references that are in the map. First posted on arXiv 16 Jul 2026.
Builds on
8 of 37 references.
References · 8
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
- 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 612
- 2018Actionable Recourse in Linear Classificationcited by 327
- 2019Interpretable Counterfactual Explanations Guided by Prototypescited by 223
- 2022A Survey on Graph Counterfactual Explanations: Definitions, Methods, Evaluation, and Research Challengescited by 30
- 2014A Survey on Soft Subspace Clusteringcited by 7
- 2025Counterfactual Explanations for k-means and Gaussian Clusteringcited by 3
- 2025Shapley-Inspired Feature Weighting in k-means with No Additional Hyperparameterscited by 1
Built on by
Not cited yet.