MDL-GBG: A Non-parametric and Interpretable Granular-Ball Generation Method for Clustering

• URL: http://arxiv.org/abs/2605.08759v2
• Date: Wed, 13 May 2026 06:17:56 GMT
• Title: MDL-GBG: A Non-parametric and Interpretable Granular-Ball Generation Method for Clustering
• Abstract summary: Existing granular-ball generation methods are mainly driven by handcrafted quality measures and splitting or stopping criteria.<n>This paper proposes Minimum Description Length based Granular-Ball Generation (MDL-GBG), a non-parametric and interpretable granular-ball generation method for clustering.
• Score: 49.85979294911059
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Existing granular-ball generation methods are still mainly driven by handcrafted quality measures and heuristic splitting or stopping criteria, which may weaken the transparency of local generation decisions in clustering. To address this issue, this paper proposes Minimum Description Length based Granular-Ball Generation (MDL-GBG), a non-parametric and interpretable granular-ball generation method for clustering. MDL-GBG reformulates granular-ball generation as a local model selection problem under the Minimum Description Length principle. For each granular ball, three candidate explanations are compared, namely a single-ball model, a two-ball model, and a core-ball-plus-residual model, and the model with the shortest description length is selected. In this way, ball retention, splitting, and residual peeling are unified within a common coding-theoretic framework. A residual reassignment mechanism is further introduced to re-evaluate peeled-off boundary samples after stable granular-balls are formed. Experiments on 20 UCI datasets show that the stable granular-balls generated by MDL-GBG provide an effective upstream representation for clustering. In particular, MDL-GBG+AC achieves the best average ranks in ARI, ACC, and NMI among the compared methods. These results indicate that MDL-GBG offers a principled and interpretable alternative to heuristic granular-ball generation strategies.

Related papers

• Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering [5.432653808002268]
  This paper proposes a Minimum Description Length based Granular-Ball Tree-Regularized Spectral Clustering method.<n>The proposed method constructs a granular-ball tree through local MDL model selection, with reciprocal neighborhood continuity used to discourage splits that break reliable local connections.<n> Experiments on real and synthetic datasets show that MDL-GBTRSC achieves the best average ARI and NMI under the adopted fixed-configuration protocol.
  arXiv  Detail & Related papers  (2026-05-21T12:36:24Z)
• A Boundary-Aware Non-parametric Granular-Ball Classifier Based on Minimum Description Length [49.85979294911059]
  Existing granular-ball classification methods are often driven by handcrafted quality measures, neighborhood rules, or average splitting and stopping criteria.<n>This paper proposes a Minimum Description Length based Granular-Ball prediction principle (MDL-GBC)<n>Experiments on 18 benchmark datasets show that MDL-GBC achieves competitive classification performance against classical methods.
  arXiv  Detail & Related papers  (2026-05-12T01:51:41Z)
• 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)
• Learnable Chernoff Baselines for Inference-Time Alignment [64.81256817158851]
  We introduce Learnable Chernoff Baselines as a method for efficiently and approximately sampling from exponentially tilted kernels.<n>We establish total-variation guarantees to the ideal aligned model, and demonstrate in both continuous and discrete diffusion settings that LCB sampling closely matches ideal rejection sampling.
  arXiv  Detail & Related papers  (2026-02-08T00:09:40Z)
• Finding Time Series Anomalies using Granular-ball Vector Data Description [29.555765407206408]
  Granular-ball One-Class Network (GBOC) is a novel approach based on a data-adaptive representation called Granular-ball Vector Data Description (GVDD)<n>GVDD partitions the latent space into compact, high-density regions represented by granular-balls.<n>During inference, anomaly scores are computed based on the distance to the nearest granular-ball.
  arXiv  Detail & Related papers  (2025-11-15T10:24:53Z)
• Boundary-Guided Policy Optimization for Memory-efficient RL of Diffusion Large Language Models [53.339700196282905]
  A key challenge in applying reinforcement learning to large language models (dLLMs) is the intractability of their likelihood functions.<n>We propose a memory-efficient RL algorithm that maximizes a specially constructed lower bound of the ELBO-based objective.<n> Experiments show that BGPO significantly outperforms previous RL algorithms for dLLMs in math problem solving, code generation, and planning tasks.
  arXiv  Detail & Related papers  (2025-10-13T17:47:50Z)
• An Enhanced Model-based Approach for Short Text Clustering [58.60681789677676]
  Short text clustering has become increasingly important with the popularity of social media like Twitter, Google+, and Facebook.<n>Existing methods can be broadly categorized into two paradigms: topic model-based approaches and deep representation learning-based approaches.<n>We propose a collapsed Gibbs Sampling algorithm for the Dirichlet Multinomial Mixture model (GSDMM), which effectively handles the sparsity and high dimensionality of short texts.<n>Based on several aspects of GSDMM that warrant further refinement, we propose an improved approach, GSDMM+, designed to further optimize its performance.
  arXiv  Detail & Related papers  (2025-07-18T10:07:42Z)
• Multi-view Granular-ball Contrastive Clustering [15.732090918798395]
  Granular balls lie between instances and clusters, naturally preserving the local topological structure of the sample set.<n>We propose a method named Multi-view Granular-ball Contrastive Clustering (MGBCC)
  arXiv  Detail & Related papers  (2024-12-18T06:53:30Z)
• Generation of Granular-Balls for Clustering Based on the Principle of Justifiable Granularity [51.58924743533048]
  This article introduces a novel GB generation method for clustering tasks. We define the coverage and specificity of a GB and introduce a comprehensive measure for assessing GB quality. Compared to previous GB generation methods, the new method maximizes the overall quality of generated GBs.
  arXiv  Detail & Related papers  (2024-05-11T04:21:32Z)
• Interpretable Ensembles of Hyper-Rectangles as Base Models [5.482532589225552]
  A new ensemble-based model with uniformly generated axis-parallel hyper-rectangles as base models (HRBM) is proposed. It is proposed to incorporate HRBMs into the gradient boosting machine (GBM)
  arXiv  Detail & Related papers  (2023-03-15T13:50:36Z)
• An Efficient and Adaptive Granular-ball Generation Method in Classification Problem [69.02474089703678]
  Granular-ball computing is an efficient, robust, and scalable learning method for granular computing. This paper proposes a method for accelerating the granular-ball generation using the division to replace $k$-means. It can greatly improve the efficiency of granular-ball generation while ensuring the accuracy similar to the existing method.
  arXiv  Detail & Related papers  (2022-01-12T07:26:19Z)

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.