Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering

Caihui Liu; Wenjing Qiu; Yong Zhang; Zeqiang Xian

arxiv: 2605.22410 · v1 · pith:6ZTFWBONnew · submitted 2026-05-21 · 💻 cs.LG

Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering

Zeqiang Xian , Caihui Liu , Yong Zhang , Wenjing Qiu This is my paper

Pith reviewed 2026-05-22 07:30 UTC · model grok-4.3

classification 💻 cs.LG

keywords spectral clusteringgranular-ball treeminimum description lengthaffinity graph regularizationreciprocal neighborhood continuitylocal connectivityshared-neighbor bridgeclustering evaluation

0 comments

The pith

A minimum description length granular-ball tree supplies coding-scale information to regularize the sample affinity graph in spectral clustering.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper sets out to establish that spectral clustering improves when a granular-ball tree is built through local minimum description length model selection. Stable leaf balls from this tree then regularize the original sample-level affinity graph using coding-scale information, while reciprocal neighborhood continuity prevents splits that would break reliable local links. A shared-neighbor bridge code further adjusts weak connections without any extra user threshold. This approach unifies local representation learning with graph construction inside one spectral clustering framework. On real and synthetic data the resulting method records the highest average ARI and NMI under a fixed-configuration protocol against classical spectral baselines and other granular-ball or anchor-based techniques.

Core claim

The authors claim that constructing a granular-ball tree via local MDL model selection, guided by reciprocal neighborhood continuity to avoid disruptive splits, yields stable leaf balls whose coding-scale information can regularize the sample-level affinity graph, thereby connecting interpretable local representations directly to affinity-graph construction within spectral clustering.

What carries the argument

The MDL-based granular-ball tree that produces stable leaf balls to supply coding-scale regularization for the affinity graph while reciprocal neighborhood continuity prevents splits that break local connections.

If this is right

Affinity graphs produced by the method adapt more effectively to heterogeneous data structures.
The approach records the best average ARI and NMI scores under the fixed-configuration protocol against the listed baselines.
The shared-neighbor bridge code removes the requirement for an additional user-specified threshold when adjusting weak local relations.
Local representation learning and affinity-graph construction become integrated inside a single spectral clustering pipeline.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same tree-based regularization could be tested on other graph-construction steps such as those used in manifold learning or semi-supervised classification.
Removing the reciprocal continuity rule in isolation would allow measurement of how much it contributes to preserving local structure on noisy data.
Applying the method to streaming or very large-scale datasets would reveal whether the MDL tree construction remains computationally practical.

Load-bearing premise

The stable leaf balls obtained from the MDL-based granular-ball tree supply coding-scale information that meaningfully regularizes the sample-level affinity graph.

What would settle it

An experiment on the same datasets showing that MDL-GBTRSC yields equal or lower average ARI and NMI than standard spectral clustering without the tree regularization would falsify the central claim.

Figures

Figures reproduced from arXiv: 2605.22410 by Caihui Liu, Wenjing Qiu, Yong Zhang, Zeqiang Xian.

**Figure 2.** Figure 2: Visualization results of MDL-GBTRSC on the 20 synthetic datasets. [PITH_FULL_IMAGE:figures/full_fig_p021_2.png] view at source ↗

**Figure 3.** Figure 3: Runtime comparison of different algorithms on the real benchmark datasets. [PITH_FULL_IMAGE:figures/full_fig_p022_3.png] view at source ↗

read the original abstract

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-based spectral clustering methods usually reduce graph complexity by using coarse-grained representatives. However, the learned local regions are often treated as graph nodes or anchors, and their structural information is not sufficiently used to regularize the original sample-level graph. To address this issue, this paper proposes a Minimum Description Length based Granular-Ball Tree-Regularized Spectral Clustering method, termed MDL-GBTRSC. 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. The stable leaf balls obtained from the tree provide coding-scale information for regularizing the sample-level affinity graph. In addition, a shared-neighbor bridge code is introduced to adjust weak local bridge relations without requiring an additional user-specified threshold. In this way, MDL-GBTRSC connects interpretable local representation learning with affinity graph construction in a unified spectral clustering framework. Experiments on real and synthetic datasets show that MDL-GBTRSC achieves the best average ARI and NMI under the adopted fixed-configuration protocol compared with classical spectral clustering baselines and representative granular-ball, micro-cluster, and anchor-based methods.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

MDL-GBTRSC ties MDL-based granular-ball trees to affinity regularization in spectral clustering, but the reported performance gains lack statistical backing.

read the letter

The main thing to know is that this paper presents MDL-GBTRSC, which builds a granular-ball tree using local minimum description length selection, applies reciprocal neighborhood continuity to keep reliable connections intact, and then uses the stable leaf balls to regularize the sample-level affinity graph. It also adds a shared-neighbor bridge code that avoids an extra threshold parameter. This is a direct extension of earlier granular-ball spectral clustering work rather than a complete reinvention. The approach does a solid job of connecting interpretable local structure learning to graph construction in one framework, and the fixed-configuration protocol removes some tuning variables that often cloud comparisons. That part is useful for readers who care about making spectral clustering more adaptive to heterogeneous data without piling on hyperparameters. The soft spot is the experimental support. The abstract claims the best average ARI and NMI against baselines and other granular or anchor methods, yet gives no error bars, run-to-run variance, or significance tests. The stress-test concern about unreported stochastic variability in the clustering step looks accurate from the description; a single-run or point-estimate ranking can easily flip with different seeds. Dataset details and ablations are also thin in the summary, which limits how much weight the superiority claim can carry right now. This paper is aimed at people already working on graph-based unsupervised methods and granular computing extensions. Someone looking for incremental but coherent improvements in affinity construction would get value from the regularization step. It deserves a serious referee because the core algorithm is internally consistent and the extension is legitimate, even if the evidence needs tightening. I would send it to review but ask the authors to add standard deviations, paired tests, and clearer ablation results before acceptance.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes MDL-GBTRSC, a spectral clustering method that builds a granular-ball tree via local Minimum Description Length (MDL) model selection, employs reciprocal neighborhood continuity to avoid disruptive splits, and uses the resulting stable leaf balls to supply coding-scale information for regularizing the sample-level affinity graph. A shared-neighbor bridge code is introduced to adjust weak local relations without an extra threshold. Under a fixed-configuration protocol, the method is reported to achieve the highest average ARI and NMI on real and synthetic datasets relative to classical spectral clustering as well as granular-ball, micro-cluster, and anchor-based baselines.

Significance. If the reported performance gains prove robust under statistical scrutiny, the work offers a principled link between MDL-driven local representation learning and affinity-graph regularization in spectral clustering. This could improve handling of heterogeneous structures while adding interpretability through the granular-ball tree. The absence of user-specified parameters in the MDL step is a potential methodological strength worth highlighting if verified.

major comments (2)

[Experimental results] Experimental results section: the headline claim of best average ARI and NMI rests on point estimates alone. No standard deviations, error bars, or statistical significance tests (e.g., paired t-test or Wilcoxon signed-rank) across random seeds or initializations are reported. Because spectral clustering itself contains stochastic elements (k-means initialization, eigenvector computation), the observed ranking could be noise rather than a reliable effect of the MDL-tree regularization; this directly undermines the central empirical claim.
[Method] Method section (granular-ball tree construction and regularization): the coding-scale information used to regularize the sample affinity graph is derived from the same MDL tree that the algorithm builds. While data-driven, this creates a moderate dependence on the method’s own intermediate outputs rather than fully external quantities; the paper should clarify whether this introduces any circularity that could affect the claimed regularization benefit.

minor comments (2)

[Method] The description of the shared-neighbor bridge code would be clearer if an explicit mathematical formulation or pseudocode were added alongside the textual explanation.
[Experiments] Dataset details (sizes, dimensionality, number of classes) and the exact fixed-configuration protocol (e.g., choice of k, affinity kernel) should be tabulated for reproducibility.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive feedback. We address each major comment below and outline the revisions we will make to strengthen the manuscript.

read point-by-point responses

Referee: [Experimental results] Experimental results section: the headline claim of best average ARI and NMI rests on point estimates alone. No standard deviations, error bars, or statistical significance tests (e.g., paired t-test or Wilcoxon signed-rank) across random seeds or initializations are reported. Because spectral clustering itself contains stochastic elements (k-means initialization, eigenvector computation), the observed ranking could be noise rather than a reliable effect of the MDL-tree regularization; this directly undermines the central empirical claim.

Authors: We agree that the current results rely solely on point estimates and do not sufficiently account for the stochastic components in spectral clustering. In the revised manuscript we will rerun all experiments over multiple random seeds (at least 10 runs per dataset), report mean ARI and NMI values together with standard deviations, and include statistical significance tests (Wilcoxon signed-rank test) comparing MDL-GBTRSC against each baseline. These additions will be placed in an expanded experimental results section with new tables and error-bar plots. revision: yes
Referee: [Method] Method section (granular-ball tree construction and regularization): the coding-scale information used to regularize the sample affinity graph is derived from the same MDL tree that the algorithm builds. While data-driven, this creates a moderate dependence on the method’s own intermediate outputs rather than fully external quantities; the paper should clarify whether this introduces any circularity that could affect the claimed regularization benefit.

Authors: The referee correctly notes the dependence on intermediate outputs. The granular-ball tree is constructed first via local MDL selection; the resulting leaf-ball coding scales are then applied in a subsequent, one-way regularization step to the sample-level affinity graph. This is a feed-forward process rather than a circular one, because the regularization does not feed back into the tree construction or MDL selection. We will insert a short clarifying paragraph in the method section that explicitly describes this sequential information flow and states that no circular dependency exists. revision: partial

Circularity Check

1 steps flagged

Moderate dependence: regularization uses coding scales derived from the same MDL tree construction

specific steps

fitted input called prediction [Abstract, paragraph 3]
"The stable leaf balls obtained from the tree provide coding-scale information for regularizing the sample-level affinity graph."

The coding-scale quantities are produced by the MDL-based granular-ball tree construction that is itself a core component of MDL-GBTRSC; using those same derived scales to regularize the affinity graph therefore makes the regularization step depend on intermediate outputs of the proposed algorithm rather than on fully external or independently validated quantities.

full rationale

The core algorithmic step constructs a granular-ball tree via local MDL model selection and then feeds the resulting leaf-ball coding scales directly into sample-level affinity regularization. This is a self-contained algorithmic dependency rather than a statistical prediction forced by fitting, and the method is evaluated on external real/synthetic datasets with fixed-configuration comparisons. No self-citation chains or imported uniqueness theorems appear in the provided text. The dependence is therefore moderate (score 4) but does not reduce the central claim to a tautology.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the standard MDL principle for local model selection and the domain assumption that neighborhood continuity encodes reliable connectivity; no new free parameters or invented entities are explicitly introduced in the abstract.

axioms (2)

standard math Minimum Description Length principle selects the best local model for granular-ball construction
Invoked for choosing splits in the granular-ball tree.
domain assumption Reciprocal neighborhood continuity indicates reliable local connections that should not be broken
Used to discourage certain splits during tree building.

pith-pipeline@v0.9.0 · 5764 in / 1338 out tokens · 63855 ms · 2026-05-22T07:30:08.017648+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

constructs a granular-ball tree through local MDL model selection, with reciprocal neighborhood continuity used to discourage splits
IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean absolute_floor_iff_bare_distinguishability unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

stable leaf balls provide coding-scale information for regularizing the sample-level affinity graph

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages · 2 internal anchors

[1]

L. Hu, M. Jiang, J. Dong, X. Liu, Z. He, Interpretable clustering: A survey, ACM Computing Surveys 58 (8) (2026) 1–21

work page 2026
[2]

Von Luxburg, A tutorial on spectral clustering, Statistics and computing 17 (4) (2007) 395–416

U. Von Luxburg, A tutorial on spectral clustering, Statistics and computing 17 (4) (2007) 395–416

work page 2007
[3]

A. Ng, M. Jordan, Y. Weiss, On spectral clustering: Analysis and an algorithm, Advances in neural information processing systems 14 (2001)

work page 2001
[4]

L. Ding, C. Li, D. Jin, S. Ding, Survey of spectral clustering based on graph theory, Pattern Recognition 151 (2024) 110366

work page 2024
[5]

Berahmand, F

K. Berahmand, F. Saberi-Movahed, R. Sheikhpour, Y. Li, M. Jalili, A comprehen- sive survey on spectral clustering with graph structure learning, arXiv preprint arXiv:2501.13597 (2025)

work page arXiv 2025
[6]

L. Kong, J. Xue, F. Nie, X. Li, Direct spectral clustering with new graph learning for better fitting, IEEE Transactions on Knowledge and Data Engineering 37 (7) (2025) 3991–4002

work page 2025
[7]

N. Wang, Z. Cui, A. Li, Y. Lu, R. Wang, F. Nie, Structured doubly stochastic graph-based clustering, IEEE Transactions on Neural Networks and Learning Systems 36 (6) (2025) 11064–11077

work page 2025
[8]

J. Li, F. Qi, H. Yuan, C. Zhong, H. Cai, Stacked network to realize spectral clustering with adaptive graph learning, IEEE Transactions on Knowledge and Data Engineering 36 (7) (2023) 3501–3513

work page 2023
[9]

X.Yang, M.Zhu, Y.Cai, Z.Wang, F.Nie, Fast spectralclusteringwith self-adapted bipartite graph learning, Information Sciences 644 (2023) 118810

work page 2023
[10]

R. Wang, H. Chen, Y. Lu, Q. Zhang, F. Nie, X. Li, Discrete and balanced spectral clustering with scalability, IEEE Transactions on Pattern Analysis and Machine Intelligence 45 (12) (2023) 14321–14336

work page 2023
[11]

C. Gao, W. Chen, F. Nie, W. Yu, Z. Wang, Spectral clustering with linear embedding: A discrete clustering method for large-scale data, Pattern Recognition 151 (2024) 110396. 24

work page 2024
[12]

J. Zhou, X. Zhang, C. Gao, Z. Lai, W. Pedrycz, Efficient spectral embedding representation approximation for large-scale data clustering, Pattern Recognition (2025) 112693

work page 2025
[13]

Zhang, J

W. Zhang, J. Zhao, L. Yu, S. Wang, Gmm enhanced anchor-based spectral clusteringforlarge-scaledata, IEEETransactionsonNeuralNetworksandLearning Systems 36 (10) (2025) 18089–18103

work page 2025
[14]

Naseri, M

N. Naseri, M. Eftekhari, F. Saberi-Movahed, M. Radjabalipour, L. A. Belanche, A similarity measure based on subspace distance for spectral clustering, Neurocom- puting 620 (2025) 129187

work page 2025
[15]

Y. Zhu, Q. Li, W. Liu, C. Yin, Diffusion process with structural changes for subspace clustering, Pattern Recognition 158 (2025) 111066

work page 2025
[16]

G. Yue, A. Deng, Y. Qu, H. Cui, X. Wang, Stratified multi-density spectral clustering using gaussian mixture model, Information Sciences 633 (2023) 182–203

work page 2023
[17]

S. Xia, G. Wang, X. Gao, X. Lian, Granular-ball computing: an efficient, robust, and interpretable adaptive multi-granularity representation and computation method, arXiv preprint arXiv:2304.11171 (2023)

work page arXiv 2023
[18]

S. Xia, Y. Liu, X. Ding, G. Wang, H. Yu, Y. Luo, Granular ball computing classifiers for efficient, scalable and robust learning, Information Sciences 483 (2019) 136–152

work page 2019
[19]

S. Xia, B. Shi, Y. Wang, J. Xie, G. Wang, X. Gao, Gbct: efficient and adaptive clustering via granular-ball computing for complex data, IEEE Transactions on Neural Networks and Learning Systems 36 (7) (2025) 12159–12172

work page 2025
[20]

J. Xie, W. Kong, S. Xia, G. Wang, X. Gao, An efficient spectral clustering algorithm based on granular-ball, IEEE Transactions on Knowledge and Data Engineering 35 (9) (2023) 9743–9753

work page 2023
[21]

Cheng, S

D. Cheng, S. Liu, S. Xia, G. Wang, Granular-ball computing-based manifold clustering algorithms for ultra-scalable data, Expert Systems with Applications 247 (2024) 123313

work page 2024
[22]

Cheng, X

D. Cheng, X. Jiang, S. Xia, G. Wang, J. Huang, S. Zhang, Y. Wang, Fast spectral clustering via pseudo-label-based granular-ball division for large-scale data, IEEE Transactions on Knowledge and Data Engineering 38 (5) (2026) 2807–2817

work page 2026
[23]

Z. Xu, Z. Long, H. Meng, Clustering by mining density distributions and split- ting manifold structure, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 39, 2025, pp. 21842–21849

work page 2025
[24]

Z. Xian, C. Liu, Y. Zhang, W. Qiu, D. Miao, W. Pedrycz, Mdl-gbg: A non- parametric and interpretable granular-ball generation method for clustering, arXiv preprint arXiv:2605.08759 (2026)

work page internal anchor Pith review Pith/arXiv arXiv 2026
[25]

Z. Xian, C. Liu, Y. Zhang, W. Qiu, D. Miao, W. Pedrycz, A boundary-aware non-parametric granular-ball classifier based on minimum description length, arXiv preprint arXiv:2605.11406 (2026). 25 Appendix A. Complete Visualization Results of the Compared Algorithms Thisappendixprovidesthecompletevisualizationresultsofthecomparedalgorithms on the 20 synthetic...

work page internal anchor Pith review Pith/arXiv arXiv 2026

[1] [1]

L. Hu, M. Jiang, J. Dong, X. Liu, Z. He, Interpretable clustering: A survey, ACM Computing Surveys 58 (8) (2026) 1–21

work page 2026

[2] [2]

Von Luxburg, A tutorial on spectral clustering, Statistics and computing 17 (4) (2007) 395–416

U. Von Luxburg, A tutorial on spectral clustering, Statistics and computing 17 (4) (2007) 395–416

work page 2007

[3] [3]

A. Ng, M. Jordan, Y. Weiss, On spectral clustering: Analysis and an algorithm, Advances in neural information processing systems 14 (2001)

work page 2001

[4] [4]

L. Ding, C. Li, D. Jin, S. Ding, Survey of spectral clustering based on graph theory, Pattern Recognition 151 (2024) 110366

work page 2024

[5] [5]

Berahmand, F

K. Berahmand, F. Saberi-Movahed, R. Sheikhpour, Y. Li, M. Jalili, A comprehen- sive survey on spectral clustering with graph structure learning, arXiv preprint arXiv:2501.13597 (2025)

work page arXiv 2025

[6] [6]

L. Kong, J. Xue, F. Nie, X. Li, Direct spectral clustering with new graph learning for better fitting, IEEE Transactions on Knowledge and Data Engineering 37 (7) (2025) 3991–4002

work page 2025

[7] [7]

N. Wang, Z. Cui, A. Li, Y. Lu, R. Wang, F. Nie, Structured doubly stochastic graph-based clustering, IEEE Transactions on Neural Networks and Learning Systems 36 (6) (2025) 11064–11077

work page 2025

[8] [8]

J. Li, F. Qi, H. Yuan, C. Zhong, H. Cai, Stacked network to realize spectral clustering with adaptive graph learning, IEEE Transactions on Knowledge and Data Engineering 36 (7) (2023) 3501–3513

work page 2023

[9] [9]

X.Yang, M.Zhu, Y.Cai, Z.Wang, F.Nie, Fast spectralclusteringwith self-adapted bipartite graph learning, Information Sciences 644 (2023) 118810

work page 2023

[10] [10]

R. Wang, H. Chen, Y. Lu, Q. Zhang, F. Nie, X. Li, Discrete and balanced spectral clustering with scalability, IEEE Transactions on Pattern Analysis and Machine Intelligence 45 (12) (2023) 14321–14336

work page 2023

[11] [11]

C. Gao, W. Chen, F. Nie, W. Yu, Z. Wang, Spectral clustering with linear embedding: A discrete clustering method for large-scale data, Pattern Recognition 151 (2024) 110396. 24

work page 2024

[12] [12]

J. Zhou, X. Zhang, C. Gao, Z. Lai, W. Pedrycz, Efficient spectral embedding representation approximation for large-scale data clustering, Pattern Recognition (2025) 112693

work page 2025

[13] [13]

Zhang, J

W. Zhang, J. Zhao, L. Yu, S. Wang, Gmm enhanced anchor-based spectral clusteringforlarge-scaledata, IEEETransactionsonNeuralNetworksandLearning Systems 36 (10) (2025) 18089–18103

work page 2025

[14] [14]

Naseri, M

N. Naseri, M. Eftekhari, F. Saberi-Movahed, M. Radjabalipour, L. A. Belanche, A similarity measure based on subspace distance for spectral clustering, Neurocom- puting 620 (2025) 129187

work page 2025

[15] [15]

Y. Zhu, Q. Li, W. Liu, C. Yin, Diffusion process with structural changes for subspace clustering, Pattern Recognition 158 (2025) 111066

work page 2025

[16] [16]

G. Yue, A. Deng, Y. Qu, H. Cui, X. Wang, Stratified multi-density spectral clustering using gaussian mixture model, Information Sciences 633 (2023) 182–203

work page 2023

[17] [17]

S. Xia, G. Wang, X. Gao, X. Lian, Granular-ball computing: an efficient, robust, and interpretable adaptive multi-granularity representation and computation method, arXiv preprint arXiv:2304.11171 (2023)

work page arXiv 2023

[18] [18]

S. Xia, Y. Liu, X. Ding, G. Wang, H. Yu, Y. Luo, Granular ball computing classifiers for efficient, scalable and robust learning, Information Sciences 483 (2019) 136–152

work page 2019

[19] [19]

S. Xia, B. Shi, Y. Wang, J. Xie, G. Wang, X. Gao, Gbct: efficient and adaptive clustering via granular-ball computing for complex data, IEEE Transactions on Neural Networks and Learning Systems 36 (7) (2025) 12159–12172

work page 2025

[20] [20]

J. Xie, W. Kong, S. Xia, G. Wang, X. Gao, An efficient spectral clustering algorithm based on granular-ball, IEEE Transactions on Knowledge and Data Engineering 35 (9) (2023) 9743–9753

work page 2023

[21] [21]

Cheng, S

D. Cheng, S. Liu, S. Xia, G. Wang, Granular-ball computing-based manifold clustering algorithms for ultra-scalable data, Expert Systems with Applications 247 (2024) 123313

work page 2024

[22] [22]

Cheng, X

D. Cheng, X. Jiang, S. Xia, G. Wang, J. Huang, S. Zhang, Y. Wang, Fast spectral clustering via pseudo-label-based granular-ball division for large-scale data, IEEE Transactions on Knowledge and Data Engineering 38 (5) (2026) 2807–2817

work page 2026

[23] [23]

Z. Xu, Z. Long, H. Meng, Clustering by mining density distributions and split- ting manifold structure, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 39, 2025, pp. 21842–21849

work page 2025

[24] [24]

Z. Xian, C. Liu, Y. Zhang, W. Qiu, D. Miao, W. Pedrycz, Mdl-gbg: A non- parametric and interpretable granular-ball generation method for clustering, arXiv preprint arXiv:2605.08759 (2026)

work page internal anchor Pith review Pith/arXiv arXiv 2026

[25] [25]

Z. Xian, C. Liu, Y. Zhang, W. Qiu, D. Miao, W. Pedrycz, A boundary-aware non-parametric granular-ball classifier based on minimum description length, arXiv preprint arXiv:2605.11406 (2026). 25 Appendix A. Complete Visualization Results of the Compared Algorithms Thisappendixprovidesthecompletevisualizationresultsofthecomparedalgorithms on the 20 synthetic...

work page internal anchor Pith review Pith/arXiv arXiv 2026