Counterfactuals for Feature-Weighted Clustering

• URL: http://arxiv.org/abs/2607.14719v1
• Date: Thu, 16 Jul 2026 08:36:04 GMT
• Title: Counterfactuals for Feature-Weighted Clustering
• Abstract summary: This paper introduces VoICE, a Voronoi-Induced Counterfactual Explainability framework for feature-weighted $k$-means clustering.<n>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.
• Score: 0.7734726150561086
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Cluster-Based Dimensionality Reduction by Nonparametric Distributional Screening [1.4773309126683776]
  We consider dimensionality reduction for high-dimensional observations accompanied by a supplied partition into two or more clusters.<n>The proposed procedure compares the cluster-specific empirical distribution functions through a several-sample Kolmogorov-Smirnov separation statistic.<n>We formalize the resulting marginal cluster support and establish simultaneous finite-sample concentration over all coordinates.
  arXiv  Detail & Related papers  (2026-09-06T21:58:59Z)
• Imputation Meets Clustering: Exploiting Latent Subgroup Structure for Missing Data Recovery [52.29866804948133]
  We propose CAGI (Cluster-Aware Generative Imputation), a framework that reformulates clustering and imputation as a mutually reinforcing co-optimization process.<n>Experiments on 14 benchmark datasets with 15 representative baselines demonstrate the superiority of CAGI.
  arXiv  Detail & Related papers  (2026-07-08T02:50:02Z)
• The Condition-Number Principle for Prototype Clustering [0.0]
  We develop a geometric framework that links objective accuracy to structural recovery in prototype-based clustering.<n>We define a clustering condition number that compares within-cluster scale to the minimum loss increase required to move a point across a cluster boundary.<n>We show that errors concentrate near cluster boundaries and that sufficiently deep cluster cores are recovered exactly under strengthened local margins.
  arXiv  Detail & Related papers  (2026-04-09T03:03:01Z)
• Weight-Informed Self-Explaining Clustering for Mixed-Type Tabular Data [63.62853416081748]
  WISE is a framework that unifies representation, feature weighting, clustering, and interpretation.<n>It produces faithful, human-interpretable explanations grounded in the same primitives that drive clustering.
  arXiv  Detail & Related papers  (2026-04-07T13:18:31Z)
• Explainable cluster analysis: a bagging approach [3.5173697454104844]
  Methods rarely provide insight into which features drive the grouping of similar observations.<n>We propose an ensemble-based clustering framework that integrates bagging and feature dropout to generate feature importance scores.<n>Its effectiveness is demonstrated on multiple simulated and real-world datasets.
  arXiv  Detail & Related papers  (2026-03-20T10:34:04Z)
• GALACTIC: Global and Local Agnostic Counterfactuals for Time-series Clustering [9.33534873952683]
  This paper introduces GALACTIC, the first unified framework to bridge local and global counterfactual explainability for unsupervised time-series clustering.<n>At instance level (local), GALACTIC generates perturbations via a cluster-aware optimization objective.<n>At cluster level (global), to mitigate cognitive load and enhance interpretability, we formulate a representative CE selection problem.
  arXiv  Detail & Related papers  (2026-03-05T15:59:33Z)
• IPBC: An Interactive Projection-Based Framework for Human-in-the-Loop Semi-Supervised Clustering of High-Dimensional Data [0.0]
  High-dimensional datasets are increasingly common across scientific and industrial domains.<n>Traditional dimensionality reduction techniques generate static 2D or 3D embeddings that provide limited interpretability.<n>We propose Interactive Project-Based Clustering (IPBC), a framework that reframes clustering as an iterative human-guided visual analysis process.
  arXiv  Detail & Related papers  (2026-01-25T15:23:51Z)
• Self-Supervised Graph Embedding Clustering [70.36328717683297]
  K-means one-step dimensionality reduction clustering method has made some progress in addressing the curse of dimensionality in clustering tasks. We propose a unified framework that integrates manifold learning with K-means, resulting in the self-supervised graph embedding framework.
  arXiv  Detail & Related papers  (2024-09-24T08:59:51Z)
• You Never Cluster Alone [150.94921340034688]
  We extend the mainstream contrastive learning paradigm to a cluster-level scheme, where all the data subjected to the same cluster contribute to a unified representation. We define a set of categorical variables as clustering assignment confidence, which links the instance-level learning track with the cluster-level one. By reparametrizing the assignment variables, TCC is trained end-to-end, requiring no alternating steps.
  arXiv  Detail & Related papers  (2021-06-03T14:59:59Z)
• Towards Uncovering the Intrinsic Data Structures for Unsupervised Domain Adaptation using Structurally Regularized Deep Clustering [119.88565565454378]
  Unsupervised domain adaptation (UDA) is to learn classification models that make predictions for unlabeled data on a target domain. We propose a hybrid model of Structurally Regularized Deep Clustering, which integrates the regularized discriminative clustering of target data with a generative one. Our proposed H-SRDC outperforms all the existing methods under both the inductive and transductive settings.
  arXiv  Detail & Related papers  (2020-12-08T08:52:00Z)
• Contradictory Structure Learning for Semi-supervised Domain Adaptation [67.89665267469053]
  Current adversarial adaptation methods attempt to align the cross-domain features. Two challenges remain unsolved: 1) the conditional distribution mismatch and 2) the bias of the decision boundary towards the source domain. We propose a novel framework for semi-supervised domain adaptation by unifying the learning of opposite structures.
  arXiv  Detail & Related papers  (2020-02-06T22:58:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.