Research map / Learning theory and algorithms / Clustering
GBSK: Skeleton Clustering via Granular-ball Computing and Multi-Sampling for Large-Scale Data
Yewang Chen, Junfeng Li, Shuyin Xia, Qinghong Lai, Xinbo Gao, Guoyin Wang, Dongdong Cheng, Yi Liu, Yi Wang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add multi-sampling (ablation) | GBSK · MNIST8M | time (s): 8733.12 s -> 184.13 s | Improved |
| add multi-sampling (ablation) | GBSK · MNIST8M | ACC: 0.437 -> 0.521 | Improved |
| add multi-sampling (ablation) | GBSK · AGC100M | memory: out of memory | Improved |
| add multi-sampling (ablation) | GBSK · MNIST | time (s): 30.10 s -> 6.82 s | Improved |
| add multi-sampling (ablation) | GBSK · Pendigits | ACC: 0.727 -> 0.796 | Improved |
| add representative and key balls (ablation) | GBSK · MNIST8M | time (s): 5856.43 s -> 184.13 s | Improved |
| add representative and key balls (ablation) | GBSK · MNIST8M | ACC: 0.387 -> 0.521 | Improved |
| add representative and key balls (ablation) | GBSK · AGC100M | ACC: 0.951 -> 0.962 | Hurt |
| add representative and key balls (ablation) | GBSK · AGC100M | time (s): 27877.79 s -> 491.23 s | Improved |
| add granular-ball generation (vs density peaks) (ablation) | GBSK · MNIST | ACC: 0.448 -> 0.557 | Improved |
| add granular-ball generation (vs density peaks) (ablation) | GBSK · MNIST8M | ACC: 0.338 -> 0.521 | Improved |
| add granular-ball generation (vs density peaks) (ablation) | GBSK · MNIST8M | time (s): 538.62 s -> 184.13 s | Improved |
Closest papers by meaning
- Structure-aware Granular-Ball based Information Bottleneck for Multi-modal Clustering (ICML 2026 · similarity 0.86)
- A Sampling-Based Approach for Efficient Clustering in Large Datasets (CVPR 2022 · similarity 0.86)
- AW-GBGAE: An Adaptive Weighted Graph Autoencoder Based on Granular-Balls for General Data Clustering (TPAMI 2025 · similarity 0.85)
- Scalable and Globally Optimal Generalized L₁ K-center Clustering via Constraint Generation in Mixed Integer Linear Programming (AAAI 2023 · similarity 0.85)
- Scalable DBSCAN with Random Projections (NeurIPS 2024 · similarity 0.84)
- SEC: More Accurate Clustering Algorithm via Structural Entropy (AAAI 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
