Table of Contents
Fetching ...

Kernel-Free Universum Quadratic Surface Twin Support Vector Machines for Imbalanced Data

Hossein Moosaei, Milan Hladík, Ahmad Mousavi, Zheming Gao, Haojie Fu

TL;DR

This work addresses binary classification with severe class imbalance by developing kernel-free, Universum-augmented quadratic twin SVMs. The authors introduce both hinge-loss and least-squares formulations, including LS-$ rak{U}$-QTSVM and Im-$ rak{U}$-QTSVM, to model nonlinear boundaries with minimal computational overhead. They provide theoretical guarantees on existence, uniqueness, and complexity, and demonstrate strong empirical performance on artificial and public benchmark datasets, with statistical tests confirming superiority over existing methods. The methods enable effective minority-class support through Universum points, undersampling, and Hessian regularization, offering scalable and generalizable solutions for imbalanced classification tasks.

Abstract

Binary classification tasks with imbalanced classes pose significant challenges in machine learning. Traditional classifiers often struggle to accurately capture the characteristics of the minority class, resulting in biased models with subpar predictive performance. In this paper, we introduce a novel approach to tackle this issue by leveraging Universum points to support the minority class within quadratic twin support vector machine models. Unlike traditional classifiers, our models utilize quadratic surfaces instead of hyperplanes for binary classification, providing greater flexibility in modeling complex decision boundaries. By incorporating Universum points, our approach enhances classification accuracy and generalization performance on imbalanced datasets. We generated four artificial datasets to demonstrate the flexibility of the proposed methods. Additionally, we validated the effectiveness of our approach through empirical evaluations on benchmark datasets, showing superior performance compared to conventional classifiers and existing methods for imbalanced classification.

Kernel-Free Universum Quadratic Surface Twin Support Vector Machines for Imbalanced Data

TL;DR

This work addresses binary classification with severe class imbalance by developing kernel-free, Universum-augmented quadratic twin SVMs. The authors introduce both hinge-loss and least-squares formulations, including LS--QTSVM and Im--QTSVM, to model nonlinear boundaries with minimal computational overhead. They provide theoretical guarantees on existence, uniqueness, and complexity, and demonstrate strong empirical performance on artificial and public benchmark datasets, with statistical tests confirming superiority over existing methods. The methods enable effective minority-class support through Universum points, undersampling, and Hessian regularization, offering scalable and generalizable solutions for imbalanced classification tasks.

Abstract

Binary classification tasks with imbalanced classes pose significant challenges in machine learning. Traditional classifiers often struggle to accurately capture the characteristics of the minority class, resulting in biased models with subpar predictive performance. In this paper, we introduce a novel approach to tackle this issue by leveraging Universum points to support the minority class within quadratic twin support vector machine models. Unlike traditional classifiers, our models utilize quadratic surfaces instead of hyperplanes for binary classification, providing greater flexibility in modeling complex decision boundaries. By incorporating Universum points, our approach enhances classification accuracy and generalization performance on imbalanced datasets. We generated four artificial datasets to demonstrate the flexibility of the proposed methods. Additionally, we validated the effectiveness of our approach through empirical evaluations on benchmark datasets, showing superior performance compared to conventional classifiers and existing methods for imbalanced classification.

Paper Structure

This paper contains 19 sections, 3 theorems, 55 equations, 3 figures, 4 tables, 1 algorithm.

Key Result

theorem 1

The problem im-ls-u-q-tsvm always has an optimal solution.

Figures (3)

  • Figure 1: Im-LS-U-QTSVM on artificial data sets
  • Figure 2: Heatmap of relative rank of CPU time. For each row, the unit is closer to red if its CPU time is longer, while the unit is closer to green if the CPU time is shorter.
  • Figure 3: Visualization of Nemenyi test.

Theorems & Definitions (9)

  • definition thmcounterdefinition
  • remark thmcounterremark
  • theorem 1
  • proof
  • theorem 2
  • proof
  • proposition thmcounterproposition
  • proof
  • remark thmcounterremark: Computational Complexity