scholarly journals A Parallel Genetic Algorithm Based Feature Selection and Parameter Optimization for Support Vector Machine

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Zhi Chen ◽  
Tao Lin ◽  
Ningjiu Tang ◽  
Xin Xia
Keyword(s):  
Genetic Algorithm ◽  
Classification Accuracy ◽  
Coarse Grained ◽  
Support Vector ◽  
Svm Classifier ◽  
Feature Subset ◽  
Parallel Genetic Algorithm ◽  
Support Vectors ◽  
Optimal Feature Subset ◽  
Optimal Feature

The extensive applications of support vector machines (SVMs) require efficient method of constructing a SVM classifier with high classification ability. The performance of SVM crucially depends on whether optimal feature subset and parameter of SVM can be efficiently obtained. In this paper, a coarse-grained parallel genetic algorithm (CGPGA) is used to simultaneously optimize the feature subset and parameters for SVM. The distributed topology and migration policy of CGPGA can help find optimal feature subset and parameters for SVM in significantly shorter time, so as to increase the quality of solution found. In addition, a new fitness function, which combines the classification accuracy obtained from bootstrap method, the number of chosen features, and the number of support vectors, is proposed to lead the search of CGPGA to the direction of optimal generalization error. Experiment results on 12 benchmark datasets show that our proposed approach outperforms genetic algorithm (GA) based method and grid search method in terms of classification accuracy, number of chosen features, number of support vectors, and running time.

scholarly journals Classification of SSVEP-based BCIs using Genetic Algorithm

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Hamideh Soltani ◽  
Zahra Einalou ◽  
Mehrdad Dadgostar ◽  
Keivan Maghooli
Keyword(s):  
Genetic Algorithm ◽  
Dimension Reduction ◽  
Classification Accuracy ◽  
Bayesian Method ◽  
Computer Interface ◽  
Support Vector ◽  
Svm Classifier ◽  
Effective Dimension ◽  
Effective Dimension Reduction

AbstractBrain computer interface (BCI) systems have been regarded as a new way of communication for humans. In this research, common methods such as wavelet transform are applied in order to extract features. However, genetic algorithm (GA), as an evolutionary method, is used to select features. Finally, classification was done using the two approaches support vector machine (SVM) and Bayesian method. Five features were selected and the accuracy of Bayesian classification was measured to be 80% with dimension reduction. Ultimately, the classification accuracy reached 90.4% using SVM classifier. The results of the study indicate a better feature selection and the effective dimension reduction of these features, as well as a higher percentage of classification accuracy in comparison with other studies.

A New Hybrid Feature Subset Selection Framework Based on Binary Genetic Algorithm and Information Theory

2019 ◽  
Vol 18 (03) ◽  
pp. 1950020 ◽  
Author(s):  
Alok Kumar Shukla ◽  
Pradeep Singh ◽  
Manu Vardhan
Keyword(s):  
Genetic Algorithm ◽  
Feature Selection ◽  
Classification Accuracy ◽  
B Cell Lymphoma ◽  
Feature Subset Selection ◽  
Classification Model ◽  
Significant Feature ◽  
Support Vector ◽  
Feature Subset ◽  
Binary Genetic Algorithm

The explosion of the high-dimensional dataset in the scientific repository has been encouraging interdisciplinary research on data mining, pattern recognition and bioinformatics. The fundamental problem of the individual Feature Selection (FS) method is extracting informative features for classification model and to seek for the malignant disease at low computational cost. In addition, existing FS approaches overlook the fact that for a given cardinality, there can be several subsets with similar information. This paper introduces a novel hybrid FS algorithm, called Filter-Wrapper Feature Selection (FWFS) for a classification problem and also addresses the limitations of existing methods. In the proposed model, the front-end filter ranking method as Conditional Mutual Information Maximization (CMIM) selects the high ranked feature subset while the succeeding method as Binary Genetic Algorithm (BGA) accelerates the search in identifying the significant feature subsets. One of the merits of the proposed method is that, unlike an exhaustive method, it speeds up the FS procedure without lancing of classification accuracy on reduced dataset when a learning model is applied to the selected subsets of features. The efficacy of the proposed (FWFS) method is examined by Naive Bayes (NB) classifier which works as a fitness function. The effectiveness of the selected feature subset is evaluated using numerous classifiers on five biological datasets and five UCI datasets of a varied dimensionality and number of instances. The experimental results emphasize that the proposed method provides additional support to the significant reduction of the features and outperforms the existing methods. For microarray data-sets, we found the lowest classification accuracy is 61.24% on SRBCT dataset and highest accuracy is 99.32% on Diffuse large B-cell lymphoma (DLBCL). In UCI datasets, the lowest classification accuracy is 40.04% on the Lymphography using k-nearest neighbor (k-NN) and highest classification accuracy is 99.05% on the ionosphere using support vector machine (SVM).

scholarly journals On-line Signature Verification Based on GA-SVM

2015 ◽  
Vol 11 (6) ◽  
pp. 49 ◽  
Author(s):  
Dong Huang ◽  
Jian Gao
Keyword(s):  
Genetic Algorithm ◽  
Feature Subset Selection ◽  
Signature Verification ◽  
Support Vector ◽  
Svm Classifier ◽  
Support Vector Data Description ◽  
Feature Subset ◽  
Dynamic Features ◽  
On Line ◽  
One Class Classifier

With the development of pen-based mobile device, on-line signature verification is gradually becoming a kind of important biometrics verification. This thesis proposes a method of verification of on-line handwritten signatures using both Support Vector Data Description (SVM) and Genetic Algorithm (GA). A 27-parameter feature set including shape and dynamic features is extracted from the on-line signatures data. The genuine signatures of each subject are treated as target data to train the SVM classifier. As a kernel based one-class classifier, SVM can accurately describe the feature distribution of the genuine signatures and detect the forgeries. To improving the performance of the authentication method, genetic algorithm (GA) is used to optimise classifier parameters and feature subset selection. Signature data form the SVC2013 database is used to carry out verification experiments. The proposed method can achieve an average Equal Error Rate (EER) of 4.93% of the skill forgery database.

Feature selection in classification using self-adaptive owl search optimization algorithm with elitism and mutation strategies

2021 ◽  
Vol 40 (1) ◽  
pp. 535-550
Author(s):  
Ashis Kumar Mandal ◽  
Rikta Sen ◽  
Basabi Chakraborty
Keyword(s):  
Feature Selection ◽  
Optimization Algorithm ◽  
Classification Accuracy ◽  
Heuristic Algorithms ◽  
Support Vector ◽  
Svm Classifier ◽  
Binary Particle Swarm Optimization ◽  
Feature Subset ◽  
Search Optimization ◽  
Self Adaptive

The fundamental aim of feature selection is to reduce the dimensionality of data by removing irrelevant and redundant features. As finding out the best subset of features from all possible subsets is computationally expensive, especially for high dimensional data sets, meta-heuristic algorithms are often used as a promising method for addressing the task. In this paper, a variant of recent meta-heuristic approach Owl Search Optimization algorithm (OSA) has been proposed for solving the feature selection problem within a wrapper-based framework. Several strategies are incorporated with an aim to strengthen BOSA (binary version of OSA) in searching the global best solution. The meta-parameter of BOSA is initialized dynamically and then adjusted using a self-adaptive mechanism during the search process. Besides, elitism and mutation operations are combined with BOSA to control the exploitation and exploration better. This improved BOSA is named in this paper as Modified Binary Owl Search Algorithm (MBOSA). Decision Tree (DT) classifier is used for wrapper based fitness function, and the final classification performance of the selected feature subset is evaluated by Support Vector Machine (SVM) classifier. Simulation experiments are conducted on twenty well-known benchmark datasets from UCI for the evaluation of the proposed algorithm, and the results are reported based on classification accuracy, the number of selected features, and execution time. In addition, BOSA along with three common meta-heuristic algorithms Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO), and Binary Genetic Algorithm (BGA) are used for comparison. Simulation results show that the proposed approach outperforms similar methods by reducing the number of features significantly while maintaining a comparable level of classification accuracy.

scholarly journals Insect Mass Estimation Based on Radar Cross Section Parameters and Support Vector Regression Algorithm

2020 ◽  
Vol 12 (11) ◽  
pp. 1903
Author(s):  
Cheng Hu ◽  
Shaoyang Kong ◽  
Rui Wang ◽  
Fan Zhang ◽  
Lianjun Wang
Keyword(s):  
Support Vector Regression ◽  
Cross Section ◽  
Radar Cross Section ◽  
Estimation Methods ◽  
Estimation Accuracy ◽  
Support Vector ◽  
Feature Subset ◽  
Mass Estimation ◽  
Optimal Feature Subset ◽  
Optimal Feature

Radar cross section (RCS) parameters of insect targets contain information related to their morphological parameters, which are helpful for the identification of migratory insects. Several morphological parameter estimation methods have been presented. However, most of these estimations are performed based on polynomial fitting methods, using only one or two parameters, which may limit the estimation accuracy. In this paper, a new insect mass estimation method is proposed based on support vector regression (SVR). Several RCS parameters were extracted for the estimation of insect mass. Support vector regression based on recursive feature elimination (SVRRFE) was used to obtain the optimal feature subset. Specifically, a dataset including 367 specimens was included to evaluate the performance of the proposed method. Fifteen features were extracted and ranked. The optimal feature subset contained six features and the optimal mass estimation accuracy was 78%. Additionally, traditional insect mass estimation methods were analyzed for comparison. The results prove that the proposed method is more effective and accurate for insect mass estimation. It needs to be emphasized that the poor number of experimental insects available may limit the further improvement of estimation accuracy.

The Research Based on GA-SVM Feature Selection Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1497-1502
Author(s):  
Hong Mei Li ◽  
Lin Gen Yang ◽  
Li Hua Zou
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Classification Accuracy ◽  
A Priori ◽  
Support Vector ◽  
Feature Subset ◽  
Accuracy Rate ◽  
Genetic Encoding ◽  
Optimal Feature Subset ◽  
Priori Information

To make feature subset which can gain the higher classification accuracy rate, the method based on genetic algorithms and the feature selection of support vector machine is proposed. Firstly, the ReliefF algorithm provides a priori information to GA, the parameters of the support vector machine mixed into the genetic encoding,and then using genetic algorithm finds the optimal feature subset and support vector machines parameter combination. Finally, experimental results show that the proposed algorithm can gain the higher classification accuracy rate based on the smaller feature subset.

Sign in / Sign up

Export Citation Format

Share Document