Granular-Balls based Fuzzy Twin Support Vector Machine for Classification

• URL: http://arxiv.org/abs/2408.00699v1
• Date: Thu, 1 Aug 2024 16:43:21 GMT
• Title: Granular-Balls based Fuzzy Twin Support Vector Machine for Classification
• Authors: Lixi Zhao, Weiping Ding, Duoqian Miao, Guangming Lang,
• Abstract summary: We introduce the granular-ball twin support vector machine (GBTWSVM) classifier, which integrates granular-ball computing (GBC) with the twin support vector machine (TWSVM) We design the membership and non-membership functions of granular-balls using Pythagorean fuzzy sets to differentiate the contributions of granular-balls in various regions.
• Score: 12.738411525651667
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: The twin support vector machine (TWSVM) classifier has attracted increasing attention because of its low computational complexity. However, its performance tends to degrade when samples are affected by noise. The granular-ball fuzzy support vector machine (GBFSVM) classifier partly alleviates the adverse effects of noise, but it relies solely on the distance between the granular-ball's center and the class center to design the granular-ball membership function. In this paper, we first introduce the granular-ball twin support vector machine (GBTWSVM) classifier, which integrates granular-ball computing (GBC) with the twin support vector machine (TWSVM) classifier. By replacing traditional point inputs with granular-balls, we demonstrate how to derive a pair of non-parallel hyperplanes for the GBTWSVM classifier by solving a quadratic programming problem. Subsequently, we design the membership and non-membership functions of granular-balls using Pythagorean fuzzy sets to differentiate the contributions of granular-balls in various regions. Additionally, we develop the granular-ball fuzzy twin support vector machine (GBFTSVM) classifier by incorporating GBC with the fuzzy twin support vector machine (FTSVM) classifier. We demonstrate how to derive a pair of non-parallel hyperplanes for the GBFTSVM classifier by solving a quadratic programming problem. We also design algorithms for the GBTSVM classifier and the GBFTSVM classifier. Finally, the superior classification performance of the GBTWSVM classifier and the GBFTSVM classifier on 20 benchmark datasets underscores their scalability, efficiency, and robustness in tackling classification tasks.

Related papers

• Enhanced Feature Based Granular Ball Twin Support Vector Machine [0.5492530316344587]
  We propose enhanced feature based granular ball twin support vector machine (EF-GBTSVM) The proposed model employs the coarse granularity of granular balls (GBs) as input rather than individual data samples. We undertake a thorough evaluation of the proposed EF-GBTSVM model on benchmark UCI and KEEL datasets.
  arXiv  Detail & Related papers  (2024-10-08T08:10:43Z)
• A robust three-way classifier with shadowed granular-balls based on justifiable granularity [53.39844791923145]
  We construct a robust three-way classifier with shadowed GBs for uncertain data. Our model demonstrates in managing uncertain data and effectively mitigates classification risks.
  arXiv  Detail & Related papers  (2024-07-03T08:54:45Z)
• MOKD: Cross-domain Finetuning for Few-shot Classification via Maximizing Optimized Kernel Dependence [97.93517982908007]
  In cross-domain few-shot classification, NCC aims to learn representations to construct a metric space where few-shot classification can be performed. In this paper, we find that there exist high similarities between NCC-learned representations of two samples from different classes. We propose a bi-level optimization framework, emphmaximizing optimized kernel dependence (MOKD) to learn a set of class-specific representations that match the cluster structures indicated by labeled data.
  arXiv  Detail & Related papers  (2024-05-29T05:59:52Z)
• Projection based fuzzy least squares twin support vector machine for class imbalance problems [0.9668407688201361]
  We propose a novel fuzzy based approach to deal with class imbalanced as well noisy datasets. The proposed algorithms are evaluated on several benchmark and synthetic datasets.
  arXiv  Detail & Related papers  (2023-09-27T14:28:48Z)
• Transformers meet Stochastic Block Models: Attention with Data-Adaptive Sparsity and Cost [53.746169882193456]
  Recent works have proposed various sparse attention modules to overcome the quadratic cost of self-attention. We propose a model that resolves both problems by endowing each attention head with a mixed-membership Block Model. Our model outperforms previous efficient variants as well as the original Transformer with full attention.
  arXiv  Detail & Related papers  (2022-10-27T15:30:52Z)
• Fuzzy Granular-Ball Computing Framework and Its Implementation in SVM [0.8916420423563476]
  We propose a framework for a fuzzy granular-ball computational classifier by introducing granular-ball computing into fuzzy set. The computational framework is based on the granular-balls input rather than points. The framework is extended to the fuzzy support vector machine (FSVM), and granular ball fuzzy SVM (GBFSVM) is derived.
  arXiv  Detail & Related papers  (2022-10-21T02:03:52Z)
• GBSVM: Granular-ball Support Vector Machine [46.60182022640765]
  GBSVM 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. This paper has fixed the errors of the original model of the existing GBSVM, and derived its dual model. The experimental results on the UCI benchmark datasets demonstrate that GBSVM has good robustness and efficiency.
  arXiv  Detail & Related papers  (2022-10-06T09:11:44Z)
• Large-Margin Representation Learning for Texture Classification [67.94823375350433]
  This paper presents a novel approach combining convolutional layers (CLs) and large-margin metric learning for training supervised models on small datasets for texture classification. The experimental results on texture and histopathologic image datasets have shown that the proposed approach achieves competitive accuracy with lower computational cost and faster convergence when compared to equivalent CNNs.
  arXiv  Detail & Related papers  (2022-06-17T04:07:45Z)
• Handling Imbalanced Classification Problems With Support Vector Machines via Evolutionary Bilevel Optimization [73.17488635491262]
  Support vector machines (SVMs) are popular learning algorithms to deal with binary classification problems. This article introduces EBCS-SVM: evolutionary bilevel cost-sensitive SVMs.
  arXiv  Detail & Related papers  (2022-04-21T16:08:44Z)
• Multi-view learning with privileged weighted twin support vector machine [0.0]
  Weighted twin support vector machines (WLTSVM) mines as much potential similarity information in samples as possible to improve the common short-coming of non-parallel plane classifiers. Compared with twin support vector machines (TWSVM), it reduces the time complexity by deleting the superfluous constraints using the inter-class K-Nearest Neighbor (KNN) In this paper, we propose multi-view learning with privileged weighted twin support vector machines (MPWTSVM)
  arXiv  Detail & Related papers  (2022-01-27T03:49:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.