Fuzzy support vector machine with joint optimization of genetic algorithm and fuzzy c-means

2021 ◽  
pp. 1-17
Author(s):  
Ming-Ai Li ◽  
Ruo-Tu Wang ◽  
Li-Na Wei
Keyword(s):  
Genetic Algorithm ◽  
Support Vector Machine ◽  
Joint Optimization ◽  
Cluster Center ◽  
Support Vector ◽  
Classification Problems ◽  
Fuzzy Support Vector Machine ◽  
Local Optima ◽  
Fuzzy C Means ◽  
Initial Cluster

BACKGROUND: Motor imagery electroencephalogram (MI-EEG) play an important role in the field of neurorehabilitation, and a fuzzy support vector machine (FSVM) is one of the most used classifiers. Specifically, a fuzzy c-means (FCM) algorithm was used to membership calculation to deal with the classification problems with outliers or noises. However, FCM is sensitive to its initial value and easily falls into local optima. OBJECTIVE: The joint optimization of genetic algorithm (GA) and FCM is proposed to enhance robustness of fuzzy memberships to initial cluster centers, yielding an improved FSVM (GF-FSVM). METHOD: The features of each channel of MI-EEG are extracted by the improved refined composite multivariate multiscale fuzzy entropy and fused to form a feature vector for a trial. Then, GA is employed to optimize the initial cluster center of FCM, and the fuzzy membership degrees are calculated through an iterative process and further applied to classify two-class MI-EEGs. RESULTS: Extensive experiments are conducted on two publicly available datasets, the average recognition accuracies achieve 99.89% and 98.81% and the corresponding kappa values are 0.9978 and 0.9762, respectively. CONCLUSION: The optimized cluster centers of FCM via GA are almost overlapping, showing great stability, and GF-FSVM obtains higher classification accuracies and higher consistency as well.

scholarly journals A New Method of Fuzzy Support Vector Machine Algorithm for Intrusion Detection

2020 ◽  
Vol 10 (3) ◽  
pp. 1065 ◽  
Author(s):  
Wei Liu ◽  
LinLin Ci ◽  
LiPing Liu
Keyword(s):  
Support Vector Machine ◽  
Membership Function ◽  
Sequence Data ◽  
Weight Coefficient ◽  
Cluster Center ◽  
Fuzzy Membership ◽  
Fuzzy Membership Function ◽  
Support Vector ◽  
Support Vector Machine Algorithm ◽  
Fuzzy Support Vector Machine

Since SVM is sensitive to noises and outliers of system call sequence data. A new fuzzy support vector machine algorithm based on SVDD is presented in this paper. In our algorithm, the noises and outliers are identified by a hypersphere with minimum volume while containing the maximum of the samples. The definition of fuzzy membership is considered by not only the relation between a sample and hyperplane, but also relation between samples. For each sample inside the hypersphere, the fuzzy membership function is a linear function of the distance between the sample and the hyperplane. The greater the distance, the greater the weight coefficient. For each sample outside the hypersphere, the membership function is an exponential function of the distance between the sample and the hyperplane. The greater the distance, the smaller the weight coefficient. Compared with the traditional fuzzy membership definition based on the relation between a sample and its cluster center, our method effectively distinguishes the noises or outlies from support vectors and assigns them appropriate weight coefficients even though they are distributed on the boundary between the positive and the negative classes. The experiments show that the fuzzy support vector proposed in this paper is more robust than the support vector machine and fuzzy support vector machines based on the distance of a sample and its cluster center.

scholarly journals Similarity Technique Effectiveness of Optimized Fuzzy C-means Clustering Based on Fuzzy Support Vector Machine for Noisy Data

2021 ◽  
Vol 9 (3) ◽  
pp. 618-629
Author(s):  
Hoda Khanali ◽  
Babak Vaziri
Keyword(s):  
Support Vector Machine ◽  
Clustering Algorithm ◽  
Noisy Data ◽  
Support Vector ◽  
Fuzzy Support Vector Machine ◽  
Fuzzy C Means ◽  
Computational Speed ◽  
Fuzzy C Means Clustering ◽  
High Degree

Fuzzy VIKOR C-means (FVCM) is a kind of unsupervised fuzzy clustering algorithm that improves the accuracyand computational speed of Fuzzy C-means (FCM). So it reduces the sensitivity to noisy and outlier data, and enhances performance and quality of clusters. Since FVCM allocates some data to a specific cluster based on similarity technique, reducing the effect of noisy data increases the quality of the clusters. This paper presents a new approach to the accurate location of noisy data to the clusters overcoming the constraints of noisy points through fuzzy support vector machine (FSVM), called FVCM-FSVM, so that at each stage samples with a high degree of membership are selected for training in the classification of FSVM. Then, the labels of the remaining samples are predicted so the process continues until the convergence of the FVCM-FSVM. The results of the numerical experiments showed the proposed approach has better performance than FVCM. Of course, it greatly achieves high accuracy.

υ-Nonparallel parametric margin fuzzy support vector machine

2021 ◽  
pp. 1-17
Author(s):  
Hongmei Ju ◽  
Yafang Zhang ◽  
Ye Zhao
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Statistical Significance ◽  
Research Direction ◽  
Support Vector ◽  
Risk Minimization ◽  
Classification Problems ◽  
Fuzzy Support Vector Machine ◽  
Data Set ◽  
Minimization Principle

Classification problem is an important research direction in machine learning. υ-nonparallel support vector machine (υ-NPSVM) is an important classifier used to solve classification problems. It is widely used because of its structural risk minimization principle, kernel trick, and sparsity. However, when solving classification problems, υ-NPSVM will encounter the problem of sample noises and heteroscedastic noise structure, which will affect its performance. In this paper, two improvements are made on the υ-NPSVM model, and a υ-nonparallel parametric margin fuzzy support vector machine (par-υ-FNPSVM) is established. On the one hand, for the noises that may exist in the data set, the neighbor information is used to add fuzzy membership to the samples, so that the contribution of each sample to the classification is treated differently. On the other hand, in order to reduce the effect of heteroscedastic structure, an insensitive loss function is introduced. The advantages of the new model are verified through UCI machine learning standard data set experiments. Finally, Friedman test and Bonferroni-Dunn test are used to verify the statistical significance of it.

Sign in / Sign up

Export Citation Format

Share Document