Granular Ball Twin Support Vector Machine with Universum Data

• URL: http://arxiv.org/abs/2412.03375v1
• Date: Wed, 04 Dec 2024 15:02:28 GMT
• Title: Granular Ball Twin Support Vector Machine with Universum Data
• Authors: M. A. Ganaie, Vrushank Ahire,
• Abstract summary: We propose a novel Granular Ball Twin Support Vector Machine with Universum Data (GBU-TSVM) The proposed GBU-TSVM represents data instances as hyper-balls rather than points in the feature space. By grouping data points into granular balls, the model achieves superior computational efficiency, increased noise resistance, and enhanced interpretability.
• Score: 4.573310303307945
• License:
• Abstract: Classification with support vector machines (SVM) often suffers from limited performance when relying solely on labeled data from target classes and is sensitive to noise and outliers. Incorporating prior knowledge from Universum data and more robust data representations can enhance accuracy and efficiency. Motivated by these findings, we propose a novel Granular Ball Twin Support Vector Machine with Universum Data (GBU-TSVM) that extends the TSVM framework to leverage both Universum samples and granular ball computing during model training. Unlike existing TSVM methods, the proposed GBU-TSVM represents data instances as hyper-balls rather than points in the feature space. This innovative approach improves the model's robustness and efficiency, particularly in handling noisy and large datasets. By grouping data points into granular balls, the model achieves superior computational efficiency, increased noise resistance, and enhanced interpretability. Additionally, the inclusion of Universum data, which consists of samples that are not strictly from the target classes, further refines the classification boundaries. This integration enriches the model with contextual information, refining classification boundaries and boosting overall accuracy. Experimental results on UCI benchmark datasets demonstrate that the GBU-TSVM outperforms existing TSVM models in both accuracy and computational efficiency. These findings highlight the potential of the GBU-TSVM model in setting a new standard in data representation and classification.

Related papers

• DreamMask: Boosting Open-vocabulary Panoptic Segmentation with Synthetic Data [61.62554324594797]
  We propose DreamMask, which explores how to generate training data in the open-vocabulary setting, and how to train the model with both real and synthetic data. In general, DreamMask significantly simplifies the collection of large-scale training data, serving as a plug-and-play enhancement for existing methods. For instance, when trained on COCO and tested on ADE20K, the model equipped with DreamMask outperforms the previous state-of-the-art by a substantial margin of 2.1% mIoU.
  arXiv  Detail & Related papers  (2025-01-03T19:00:00Z)
• Leveraging Semi-Supervised Learning to Enhance Data Mining for Image Classification under Limited Labeled Data [35.431340001608476]
  Traditional data mining methods are inadequate when faced with large-scale, high-dimensional and complex data. This study introduces semi-supervised learning methods, aiming to improve the algorithm's ability to utilize unlabeled data. Specifically, we adopt a self-training method and combine it with a convolutional neural network (CNN) for image feature extraction and classification.
  arXiv  Detail & Related papers  (2024-11-27T18:59:50Z)
• Intuitionistic Fuzzy Universum Twin Support Vector Machine for Imbalanced Data [0.0]
  One of the major difficulties in machine learning methods is categorizing datasets that are imbalanced. We propose intuitionistic fuzzy universum twin support vector machines for imbalanced data (IFUTSVM-ID) We use an intuitionistic fuzzy membership scheme to mitigate the impact of noise and outliers.
  arXiv  Detail & Related papers  (2024-10-27T04:25:42Z)
• Enhancing Robustness and Efficiency of Least Square Twin SVM via Granular Computing [0.2999888908665658]
  In the domain of machine learning, least square twin support vector machine (LSTSVM) stands out as one of the state-of-the-art models. LSTSVM suffers from sensitivity to noise and inversions, overlooking the principle and instability in resampling. We propose the robust granular ball LSTSVM (GBLSTSVM), which is trained using granular balls instead of original data points.
  arXiv  Detail & Related papers  (2024-10-22T18:13:01Z)
• Enhanced Feature Based Granular Ball Twin Support Vector Machine [0.5892638927736115]
  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)
• Granular Ball Twin Support Vector Machine [0.0]
  Nonparametric likelihood Estimator in MixtureTwin support vector machine (TSVM) is an emerging machine learning model with versatile applicability in classification and regression endeavors. TSVM confronts formidable obstacles to its efficiency and applicability on large-scale datasets. We propose the granular ball twin support vector machine (GBTSVM) and a novel large-scale granular ball twin support vector machine (LS-GBTSVM) We conduct a comprehensive evaluation of GBTSVM and LS-GBTSVM models on benchmark datasets from UCI, KEEL, and NDC datasets.
  arXiv  Detail & Related papers  (2024-10-07T06:20:36Z)
• DANCE: DAta-Network Co-optimization for Efficient Segmentation Model Training and Inference [85.02494022662505]
  DANCE is an automated simultaneous data-network co-optimization for efficient segmentation model training and inference. It integrates automated data slimming which adaptively downsamples/drops input images and controls their corresponding contribution to the training loss guided by the images' spatial complexity. Experiments and ablating studies demonstrate that DANCE can achieve "all-win" towards efficient segmentation.
  arXiv  Detail & Related papers  (2021-07-16T04:58:58Z)
• ALT-MAS: A Data-Efficient Framework for Active Testing of Machine Learning Algorithms [58.684954492439424]
  We propose a novel framework to efficiently test a machine learning model using only a small amount of labeled test data. The idea is to estimate the metrics of interest for a model-under-test using Bayesian neural network (BNN)
  arXiv  Detail & Related papers  (2021-04-11T12:14:04Z)
• Adversarial Feature Augmentation and Normalization for Visual Recognition [109.6834687220478]
  Recent advances in computer vision take advantage of adversarial data augmentation to ameliorate the generalization ability of classification models. Here, we present an effective and efficient alternative that advocates adversarial augmentation on intermediate feature embeddings. We validate the proposed approach across diverse visual recognition tasks with representative backbone networks.
  arXiv  Detail & Related papers  (2021-03-22T20:36:34Z)
• Cauchy-Schwarz Regularized Autoencoder [68.80569889599434]
  Variational autoencoders (VAE) are a powerful and widely-used class of generative models. We introduce a new constrained objective based on the Cauchy-Schwarz divergence, which can be computed analytically for GMMs. Our objective improves upon variational auto-encoding models in density estimation, unsupervised clustering, semi-supervised learning, and face analysis.
  arXiv  Detail & Related papers  (2021-01-06T17:36:26Z)
• On Coresets for Support Vector Machines [61.928187390362176]
  A coreset is a small, representative subset of the original data points. We show that our algorithm can be used to extend the applicability of any off-the-shelf SVM solver to streaming, distributed, and dynamic data settings.
  arXiv  Detail & Related papers  (2020-02-15T23:25:12Z)

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.