mlsanityData to 7 Oct 2026

GBSVM: Granular-ball Support Vector Machine

arXiv 2210.03120 ↗First posted 6 Oct 2022cs.LG cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 2 of its 64 references that are in the map. First posted on arXiv 6 Oct 2022.

Builds on

2 of 64 references.

References · 2

  1. 2022An Efficient and Adaptive Granular-ball Generation Method in Classification Problemcited by 32
  2. 2022A Unified Granular-ball Learning Model of Pawlak Rough Set and Neighborhood Rough Setcited by 12

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 4; 2024: 5.

10 papers.