GBSVR: Granular Ball Support Vector Regression

• URL: http://arxiv.org/abs/2503.10539v1
• Date: Thu, 13 Mar 2025 16:52:43 GMT
• Title: GBSVR: Granular Ball Support Vector Regression
• Authors: Reshma Rastogi, Ankush Bisht, Sanjay Kumar, Suresh Chandra,
• Abstract summary: We propose Granular Ball Support Vector Regression (GBSVR) to tackle problem of regression.<n>This work also suggests a discretization method for continuous-valued attributes to facilitate the construction of granular balls.
• Score: 12.470540422791462
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Support Vector Regression (SVR) and its variants are widely used to handle regression tasks, however, since their solution involves solving an expensive quadratic programming problem, it limits its application, especially when dealing with large datasets. Additionally, SVR uses an epsilon-insensitive loss function which is sensitive to outliers and therefore can adversely affect its performance. We propose Granular Ball Support Vector Regression (GBSVR) to tackle problem of regression by using granular ball concept. These balls are useful in simplifying complex data spaces for machine learning tasks, however, to the best of our knowledge, they have not been sufficiently explored for regression problems. Granular balls group the data points into balls based on their proximity and reduce the computational cost in SVR by replacing the large number of data points with far fewer granular balls. This work also suggests a discretization method for continuous-valued attributes to facilitate the construction of granular balls. The effectiveness of the proposed approach is evaluated on several benchmark datasets and it outperforms existing state-of-the-art approaches

Related papers

• DUPRE: Data Utility Prediction for Efficient Data Valuation [49.60564885180563]
  Cooperative game theory-based data valuation, such as Data Shapley, requires evaluating the data utility and retraining the ML model for multiple data subsets. Our framework, textttDUPRE, takes an alternative yet complementary approach that reduces the cost per subset evaluation by predicting data utilities instead of evaluating them by model retraining. Specifically, given the evaluated data utilities of some data subsets, textttDUPRE fits a emphGaussian process (GP) regression model to predict the utility of every other data subset.
  arXiv  Detail & Related papers  (2025-02-22T08:53:39Z)
• GBFRS: Robust Fuzzy Rough Sets via Granular-ball Computing [48.33779268699777]
  Fuzzy rough set theory is effective for processing datasets with complex attributes.<n>Most existing models operate at the finest granularity, rendering them inefficient and sensitive to noise.<n>This paper proposes integrating multi-granularity granular-ball computing into fuzzy rough set theory, using granular-balls to replace sample points.
  arXiv  Detail & Related papers  (2025-01-30T15:09:26Z)
• Obstacle-aware Gaussian Process Regression [3.2634122554914002]
  Obstacle-aware trajectory navigation is crucial for many systems.<n>Gaussian Process regression, in its current form, fits a curve to a set of data pairs.<n>We propose 'GP-ND' (Gaussian Process with Negative Datapairs) to fit the model to the positive data pairs while avoiding the negative ones.
  arXiv  Detail & Related papers  (2024-12-09T02:50:20Z)
• LSTSVR-PI: Least square twin support vector regression with privileged information [0.0]
  We propose a new least square twin support vector regression using privileged information (LSTSVR-PI) It integrates the LUPI paradigm to utilize additional sources of information into the least square twin support vector regression. The proposed model fills the gap between the contemporary paradigm of LUPI and classical LSTSVR.
  arXiv  Detail & Related papers  (2023-12-05T09:15:10Z)
• Equation Discovery with Bayesian Spike-and-Slab Priors and Efficient Kernels [57.46832672991433]
  We propose a novel equation discovery method based on Kernel learning and BAyesian Spike-and-Slab priors (KBASS) We use kernel regression to estimate the target function, which is flexible, expressive, and more robust to data sparsity and noises. We develop an expectation-propagation expectation-maximization algorithm for efficient posterior inference and function estimation.
  arXiv  Detail & Related papers  (2023-10-09T03:55:09Z)
• On Fast Simulation of Dynamical System with Neural Vector Enhanced Numerical Solver [59.13397937903832]
  We introduce a deep learning-based corrector called Neural Vector (NeurVec) NeurVec can compensate for integration errors and enable larger time step sizes in simulations. Our experiments on a variety of complex dynamical system benchmarks demonstrate that NeurVec exhibits remarkable generalization capability.
  arXiv  Detail & Related papers  (2022-08-07T09:02:18Z)
• A Conditional Randomization Test for Sparse Logistic Regression in High-Dimension [36.00360315353985]
  emphCRT-logit is an algorithm that combines a variable-distillation step and a decorrelation step. We provide a theoretical analysis of this procedure, and demonstrate its effectiveness on simulations, along with experiments on large-scale brain-imaging and genomics datasets.
  arXiv  Detail & Related papers  (2022-05-29T09:37:16Z)
• Adiabatic Quantum Feature Selection for Sparse Linear Regression [0.17499351967216337]
  We formulate and compare the quality of QUBO solution on synthetic and real world datasets. The results demonstrate the effectiveness of the proposed adiabatic quantum computing approach in finding the optimal solution.
  arXiv  Detail & Related papers  (2021-06-04T09:14:01Z)
• A Precise Performance Analysis of Support Vector Regression [105.94855998235232]
  We study the hard and soft support vector regression techniques applied to a set of $n$ linear measurements. Our results are then used to optimally tune the parameters intervening in the design of hard and soft support vector regression algorithms.
  arXiv  Detail & Related papers  (2021-05-21T14:26:28Z)
• Solving weakly supervised regression problem using low-rank manifold regularization [77.34726150561087]
  We solve a weakly supervised regression problem. Under "weakly" we understand that for some training points the labels are known, for some unknown, and for others uncertain due to the presence of random noise or other reasons such as lack of resources. In the numerical section, we applied the suggested method to artificial and real datasets using Monte-Carlo modeling.
  arXiv  Detail & Related papers  (2021-04-13T23:21:01Z)
• Nonlinear Distribution Regression for Remote Sensing Applications [6.664736150040092]
  In many remote sensing applications one wants to estimate variables or parameters of interest from observations. Standard algorithms such as neural networks, random forests or Gaussian processes are readily available to relate to the two. This paper introduces a nonlinear (kernel-based) method for distribution regression that solves the previous problems without making any assumption on the statistics of the grouped data.
  arXiv  Detail & Related papers  (2020-12-07T22:04:43Z)
• A Hypergradient Approach to Robust Regression without Correspondence [85.49775273716503]
  We consider a variant of regression problem, where the correspondence between input and output data is not available. Most existing methods are only applicable when the sample size is small. We propose a new computational framework -- ROBOT -- for the shuffled regression problem.
  arXiv  Detail & Related papers  (2020-11-30T21:47:38Z)

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.