MDL-GBG: A Non-parametric and Interpretable Granular-Ball Generation Method for Clustering
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-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 highest average ARI, ACC, and NMI values among the compared methods, while the Friedman-Nemenyi analysis further supports its favorable average ranking. These results indicate that MDL-GBG offers a principled and interpretable alternative to heuristic granular-ball generation strategies.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Boundary-Aware Non-parametric Granular-Ball Classifier Based on Minimum Description Length
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 de…
Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering
Spectral clustering largely depends on the affinity graph, yet constructing a graph that preserves reliable local connectivity while adapting to heterogeneous data structures remains challenging. Existing granular-ball-b…
Representation LearningGranular-ball computing: an efficient, robust, and interpretable adaptive multi-granularity representation and computation method
Human cognition operates on a "Global-first" cognitive mechanism, prioritizing information processing based on coarse-grained details. This mechanism inherently possesses an adaptive multi-granularity description capacit…
GBCT: An Efficient and Adaptive Granular-Ball Clustering Algorithm for Complex Data
Traditional clustering algorithms often focus on the most fine-grained information and achieve clustering by calculating the distance between each pair of data points or implementing other calculations based on points. T…
ClusteringGBMST: An Efficient Minimum Spanning Tree Clustering Based on Granular-Ball Computing
Most of the existing clustering methods are based on a single granularity of information, such as the distance and density of each data. This most fine-grained based approach is usually inefficient and susceptible to noi…
Clustering