Differential Search Algorithm-based Parametric Optimization of Fuzzy Generalized Eigenvalue Proximal Support Vector Machine

Abstract

Support Vector Machine (SVM) is an effective model for many classification problems. However, SVM needs the solution of a quadratic program which require specialized code. In addition, SVM has many parameters, which affects the performance of SVM classifier. Recently, the Generalized Eigenvalue Proximal SVM (GEPSVM) has been presented to solve the SVM complexity. In real world applications data may affected by error or noise, working with this data is a challenging problem. In this paper, an approach has been proposed to overcome this problem. This method is called DSA-GEPSVM. The main improvements are carried out based on the following: 1) a novel fuzzy values in the linear case. 2) A new Kernel function in the nonlinear case. 3) Differential Search Algorithm (DSA) is reformulated to find near optimal values of the GEPSVM parameters and its kernel parameters. The experimental results show that the proposed approach is able to find the suitable parameter values, and has higher classification accuracy compared with some other algorithms.

An improved crow search optimization with Bi-LSTM model for identification and classification of COVID-19 infection from chest X-Ray images

“…An LSTM approach uses several memory units, each with three gates with different purposes. The variables of the particular circumstances of the LSTM unit of tth words are supplied in the accompanying that uses the different feature S as input and the t th word as an example [23] , [24] . A specific calculation statement is used, where sigmoid function and dot multiplication are both denoted by the letters, respectively.…”

Robust <inline-formula> <tex-math notation="LaTeX">$L_{2,1}$ </tex-math> </inline-formula>-Norm Distance Enhanced Multi-Weight Vector Projection Support Vector Machine

“…Liang et al [14] put forward a Manifold regularized proximal support vector machine via generalized eigenvalue, which hold the intrinsic structure of each class by manifold regularization. Marghny and El-Aziz [15] reformulated the differential search algorithm (DSA) to seek optimal values and kernel parameters of the GEPSVM, named DSA-GEPSVM. DSA-GEPSVM reformulates the optimization of GEPSVM and basically overcomes the effect of noise in the real world.…”

Multi-View Learning With Robust Generalized Eigenvalue Proximal SVM

“…After that, Liang et al [20] proposed a novel method called manifold regularized proximal support vector machine via generalized eigenvalue (MRGEPSVM). By reformulating differential search algorithm (DSA) to find near optimal values of the GEPSVM parameters, Marghny et al proposed DSA-GEPSVM [19]. In addition, inspired of the optimization objective for GEPSVM, Jayadera et al raised twin support vector machine (TWSVM) [13], which tries to obtain two nonparallel hyperplanes by solving two small-scale QPPs instead of generalized eigenvalue problems, is an important branch of SVM.…”