Counterfactuals for Feature-Weighted Clustering

Richard J. Fawley, Renato Cordeiro de Amorim
7/16/2026
cs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{fawley2026counterfactuals,
  title  = {Counterfactuals for Feature-Weighted Clustering},
  author = {Richard J. Fawley and Renato Cordeiro de Amorim},
  year   = {2026},
  eprint = {2607.14719},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2607.14719v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2607.14719.svg)](https://codeofpaper.com/paper/2607.14719)

Discussion