An alternative to SVM Method for Data Classification

08/20/2023
by   Lakhdar Remaki, et al.
0

Support vector machine (SVM), is a popular kernel method for data classification that demonstrated its efficiency for a large range of practical applications. The method suffers, however, from some weaknesses including; time processing, risk of failure of the optimization process for high dimension cases, generalization to multi-classes, unbalanced classes, and dynamic classification. In this paper an alternative method is proposed having a similar performance, with a sensitive improvement of the aforementioned shortcomings. The new method is based on a minimum distance to optimal subspaces containing the mapped original classes.

READ FULL TEXT

page 10

page 11

research
10/11/2013

Distance-weighted Support Vector Machine

A novel linear classification method that possesses the merits of both t...
research
06/21/2019

Quantum-Inspired Support Vector Machine

Support vector machine (SVM) is a particularly powerful and flexible sup...
research
05/19/2014

A Parallel Way to Select the Parameters of SVM Based on the Ant Optimization Algorithm

A large number of experimental data shows that Support Vector Machine (S...
research
07/07/2019

Resource-Efficient Computing in Wearable Systems

We propose two optimization techniques to minimize memory usage and comp...
research
12/05/2012

Cost-Sensitive Support Vector Machines

A new procedure for learning cost-sensitive SVM(CS-SVM) classifiers is p...
research
04/03/2017

Geometric Insights into Support Vector Machine Behavior using the KKT Conditions

The Support Vector Machine (SVM) is a powerful and widely used classific...
research
10/21/2020

Batch Sequential Adaptive Designs for Global Optimization

Compared with the fixed-run designs, the sequential adaptive designs (SA...

Please sign up or login with your details

Forgot password? Click here to reset