Explainable cluster analysis: a bagging approach

• URL: http://arxiv.org/abs/2603.19840v1
• Date: Fri, 20 Mar 2026 10:34:04 GMT
• Title: Explainable cluster analysis: a bagging approach
• Abstract summary: 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.
• Score: 3.5173697454104844
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A major limitation of clustering approaches is their lack of explainability: methods rarely provide insight into which features drive the grouping of similar observations. To address this limitation, we propose an ensemble-based clustering framework that integrates bagging and feature dropout to generate feature importance scores, in analogy with feature importance mechanisms in supervised random forests. By leveraging multiple bootstrap resampling schemes and aggregating the resulting partitions, the method improves stability and robustness of the cluster definition, particularly in small-sample or noisy settings. Feature importance is assessed through an information-theoretic approach: at each step, the mutual information between each feature and the estimated cluster labels is computed and weighted by a measure of clustering validity to emphasize well-formed partitions, before being aggregated into a final score. The method outputs both a consensus partition and a corresponding measure of feature importance, enabling a unified interpretation of clustering structure and variable relevance. Its effectiveness is demonstrated on multiple simulated and real-world datasets.

Related papers

• Seed-Guided Semi-Supervised Clustering by A-Contrario Anomaly Detection [0.0]
  This paper introduces a semi-supervised clustering framework grounded in the statistical duality between grouping principles and anomaly detection.<n>We define a cluster as a maximal subset of data points containing no anomalies relative to a null hypothesis of uniform randomness.<n>We evaluate the method on synthetic and real-world benchmarks, including image and text datasets represented through raw, linear-reduced, and neighbourhood-exclusion embeddings.
  arXiv  Detail & Related papers  (2026-06-17T09:08:02Z)
• 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)
• Parameter-Free Clustering via Self-Supervised Consensus Maximization (Extended Version) [50.41628860536753]
  We propose a novel and fully parameter-free clustering framework via Self-supervised Consensus Maximization, named SCMax.<n>Our framework performs hierarchical agglomerative clustering and cluster evaluation in a single, integrated process.
  arXiv  Detail & Related papers  (2025-11-12T11:17:17Z)
• evclust: Python library for evidential clustering [0.6215404942415159]
  Evidential clustering uses the Dempster-Shafer theory of belief functions to represent uncertainty.<n>The Python framework evclust offers a suite of efficient evidence clustering algorithms as well as tools for visualizing, evaluating and analyzing credal partitions.
  arXiv  Detail & Related papers  (2025-02-10T15:53:26Z)
• Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective [52.662463893268225]
  Self-supervised heterogeneous graph learning (SHGL) has shown promising potential in diverse scenarios.<n>Existing SHGL methods encounter two significant limitations.<n>We introduce a novel framework enhanced by rank and dual consistency constraints.
  arXiv  Detail & Related papers  (2024-12-01T09:33:20Z)
• 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)
• From A-to-Z Review of Clustering Validation Indices [4.08908337437878]
  We review and evaluate the performance of internal and external clustering validation indices on the most common clustering algorithms. We suggest a classification framework for examining the functionality of both internal and external clustering validation measures.
  arXiv  Detail & Related papers  (2024-07-18T13:52:02Z)
• A structured regression approach for evaluating model performance across intersectional subgroups [53.91682617836498]
  Disaggregated evaluation is a central task in AI fairness assessment, where the goal is to measure an AI system's performance across different subgroups. We introduce a structured regression approach to disaggregated evaluation that we demonstrate can yield reliable system performance estimates even for very small subgroups.
  arXiv  Detail & Related papers  (2024-01-26T14:21:45Z)
• Rethinking Clustering-Based Pseudo-Labeling for Unsupervised Meta-Learning [146.11600461034746]
  Method for unsupervised meta-learning, CACTUs, is a clustering-based approach with pseudo-labeling. This approach is model-agnostic and can be combined with supervised algorithms to learn from unlabeled data. We prove that the core reason for this is lack of a clustering-friendly property in the embedding space.
  arXiv  Detail & Related papers  (2022-09-27T19:04:36Z)
• Algorithm-Agnostic Interpretations for Clustering [0.0]
  We propose algorithm-agnostic interpretation methods to explain clustering outcomes in reduced dimensions. The permutation feature importance for clustering represents a general framework based on shuffling feature values. All methods can be used with any clustering algorithm able to reassign instances through soft or hard labels.
  arXiv  Detail & Related papers  (2022-09-21T18:08:40Z)
• Fast and Interpretable Consensus Clustering via Minipatch Learning [0.0]
  We develop IMPACC: Interpretable MiniPatch Adaptive Consensus Clustering. We develop adaptive sampling schemes for observations, which result in both improved reliability and computational savings. Results show that our approach yields more accurate and interpretable cluster solutions.
  arXiv  Detail & Related papers  (2021-10-05T22:39:28Z)
• Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach [13.406858660972551]
  We provide a complete taxonomic characterization of robust hierarchical clustering methods for directed networks. We introduce three practical properties associated with robustness in hierarchical clustering: linear scale preservation, stability, and excisiveness. We also address the implementation of our methods and describe an application to real data.
  arXiv  Detail & Related papers  (2021-08-16T17:28:21Z)

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.