A Boundary-Aware Non-parametric Granular-Ball Classifier Based on Minimum Description Length

• URL: http://arxiv.org/abs/2605.11406v1
• Date: Tue, 12 May 2026 01:51:41 GMT
• Title: A Boundary-Aware Non-parametric Granular-Ball Classifier Based on Minimum Description Length
• Abstract summary: 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.
• Score: 49.85979294911059
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Existing granular-ball classification methods are often driven by handcrafted quality measures, neighborhood rules, or heuristic splitting and stopping criteria, which may reduce the transparency of local construction decisions and hinder explicit modeling of boundary-sensitive regions. To address this issue, this paper proposes a Minimum Description Length based Granular-Ball Classifier (MDL-GBC), a boundary-aware non-parametric and interpretable granular-ball classifier. MDL-GBC formulates class-conditional granular-ball construction as a local model selection problem under the Minimum Description Length principle. For each class, samples from the target class provide positive class evidence, while samples from the remaining classes provide negative boundary evidence. For each current granular ball, three candidate explanations are compared under a unified description-length criterion: a single-ball model, a two-ball model, and a core-boundary model. The selected model determines whether the ball is retained, geometrically split, or refined into core and boundary-sensitive child balls, thereby making local construction decisions consistent with the MDL-based classification mechanism. During prediction, a class-level mixture coding rule aggregates stable granular balls of the same class and assigns the test sample by comparing class-wise coding costs. Experiments on 18 benchmark datasets show that MDL-GBC achieves competitive classification performance against classical classifiers and representative granular-ball-based methods, obtaining the best average Accuracy, Macro-F1, and average rank. These results indicate that MDL-GBC provides an effective and interpretable alternative to conventional heuristic granular-ball classification strategies.

Related papers

• An Objective Performance Evaluation of the LSTM Networks in Time Series Classification [0.0]
  Long short-term memory (LSTM) networks have become a popular choice for time-series analysis.<n>This paper presents a performance evaluation framework comparing an LSTM classifier against a model-based expectation (EM) classifier for binary time-series classification.
  arXiv  Detail & Related papers  (2026-05-19T03:47:01Z)
• MDL-GBG: A Non-parametric and Interpretable Granular-Ball Generation Method for Clustering [49.85979294911059]
  MDL-GBG reformulates granular-ball generation as a local model selection problem under the Minimum Description Length principle.<n>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.<n>A residual reassignment mechanism is introduced to globally re-evaluate peeled-off boundary samples after stable granular-balls are formed.
  arXiv  Detail & Related papers  (2026-05-09T07:42:41Z)
• On Large Multimodal Models as Open-World Image Classifiers [77.51330631977955]
  Large Multimodal Models (LMMs) can classifying images directly using natural language.<n>We evaluate 13 models across 10 benchmarks, encompassing prototypical, non-prototypical, fine-grained, and very fine-grained classes.
  arXiv  Detail & Related papers  (2025-03-27T17:03:18Z)
• A robust three-way classifier with shadowed granular-balls based on justifiable granularity [53.39844791923145]
  We construct a robust three-way classifier with shadowed GBs for uncertain data. Our model demonstrates in managing uncertain data and effectively mitigates classification risks.
  arXiv  Detail & Related papers  (2024-07-03T08:54:45Z)
• LLM meets Vision-Language Models for Zero-Shot One-Class Classification [4.094697851983375]
  We consider the problem of zero-shot one-class visual classification. We propose a two-step solution that first queries large language models for visually confusing objects. We are the first to demonstrate the ability to discriminate a single category from other semantically related ones using only its label.
  arXiv  Detail & Related papers  (2024-03-31T12:48:07Z)
• GRSDet: Learning to Generate Local Reverse Samples for Few-shot Object Detection [15.998148904793426]
  Few-shot object detection (FSOD) aims to achieve object detection only using a few novel class training data. Most of the existing methods usually adopt a transfer-learning strategy to construct the novel class distribution. We propose generating local reverse samples (LRSamples) in Prototype Reference Frames to adaptively adjust the center position and boundary range of the novel class distribution.
  arXiv  Detail & Related papers  (2023-12-27T13:36:29Z)
• Active Learning++: Incorporating Annotator's Rationale using Local Model Explanation [84.10721065676913]
  Annotators can provide their rationale for choosing a label by ranking input features based on their importance for a given query. Instead of weighing all committee models equally to select the next instance, we assign higher weight to the committee model with higher agreement with the annotator's ranking. This approach is applicable to any kind of ML model using model-agnostic techniques to generate local explanation such as LIME.
  arXiv  Detail & Related papers  (2020-09-06T08:07:33Z)
• Solving Long-tailed Recognition with Deep Realistic Taxonomic Classifier [68.38233199030908]
  Long-tail recognition tackles the natural non-uniformly distributed data in realworld scenarios. While moderns perform well on populated classes, its performance degrades significantly on tail classes. Deep-RTC is proposed as a new solution to the long-tail problem, combining realism with hierarchical predictions.
  arXiv  Detail & Related papers  (2020-07-20T05:57:42Z)

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.