Pith. sign in

REVIEW 2 cited by

GBSVM: Granular-ball Support Vector Machine

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2210.03120 v2 pith:IJ4JMYLK submitted 2022-10-06 cs.LG cs.AI

classification cs.LGcs.AI
keywords gbsvmmodeldualalgorithmgranular-balloptimizationbeenclassifier
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

GBSVM (Granular-ball Support Vector Machine) is a significant attempt to construct a classifier using the coarse-to-fine granularity of a granular-ball as input, rather than a single data point. It is the first classifier whose input contains no points. However, the existing model has some errors, and its dual model has not been derived. As a result, the current algorithm cannot be implemented or applied. To address these problems, this paper has fixed the errors of the original model of the existing GBSVM, and derived its dual model. Furthermore, a particle swarm optimization algorithm is designed to solve the dual model. The sequential minimal optimization algorithm is also carefully designed to solve the dual model. The solution is faster and more stable than the particle swarm optimization based version. The experimental results on the UCI benchmark datasets demonstrate that GBSVM has good robustness and efficiency. All codes have been released in the open source library at http://www.cquptshuyinxia.com/GBSVM.html or https://github.com/syxiaa/GBSVM.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multi-Granularity Position Embedding of Graphs via Granular-Ball for Link Prediction

    cs.SI 2026-07 conditional novelty 6.0 of 10

    MGLP uses granular-ball graph refinement to construct hierarchical landmarks and a depth-weighted distance measure, improving link prediction over single-granularity position embeddings.

  2. GBFRS: Robust Fuzzy Rough Sets via Granular-ball Computing

    cs.AI 2025-01 reject novelty 6.0 of 10

    Granular-ball fuzzy rough sets replace sample points with coarse-grained balls to make feature selection more noise-robust.

Pith tools