Genetic Algorithm For Feature Selection Research Articles

Using Optuna and Genetic Algorithm together facilitate the classification of plant leaf diseases

The identification and severity assessment of plant leaf diseases is crucial to food security and sustainable agriculture. This study shows an innovative way to improve plant leaf disease detection. The recommended method uses Optuna for parameter optimization and the Genetic Algorithm for feature selection to improve plant leaf disease identification. We do this to improve diagnosis accuracy. This method improves classification accuracy and is called ECPLDD-OGA. Modern hyper parameter optimization framework Optuna is employed. This allows classification model parameters to be fine-tuned. A systematic feature selection method is the Genetic Algorithm. It finds the most useful characteristics in the input dataset. By applying the algorithm on the data. By facilitation, the iterative process helps create a simplified and meaningful subset of features. Contrary to parameter tinkering and feature selection, empirical data suggests that utilizing Optuna and the Genetic Algorithm simultaneously improves disease identification. The updated model recognizes sick plants more accurately and generalizes better. Optimization enabled both gains. The usage of this technology can improve agricultural operations and reduce crop losses by increasing productivity. The present ECPLDD-OGA technique helps integrate hyper parameter tweaking and feature selection into machine learning-based agricultural applications.

Using Genetic Algorithm Feature Selection to Optimize XGBoost Performance in Australian Credit

To reduce credit risk in credit institutions, credit risk management practices need to be implemented so that lending institutions can survive in the long term. Data mining is one of the techniques used for credit risk management. Where data mining can find information patterns from big data using classification techniques with the resulting level of accuracy. This research aims to increase the accuracy of classification algorithms in predicting credit risk by applying genetic algorithms as the best feature selection method. Thus, the most important feature will be used to search for credit risk information. This research applies a classification method using the XGBoost classifier on the Australian credit dataset, then carries out an evaluation by measuring the level of accuracy and AUC. The results show an increase in accuracy of 2.24%, with an accuracy value of 89.93% after optimization using a genetic algorithm. So, through research on genetic algorithm feature selection, we can improve the accuracy performance of the XGBoost algorithm on the Australian credit dataset.

Comparative Study of Various Hyperparameter Tuning on Random Forest Classification With SMOTE and Feature Selection Using Genetic Algorithm in Software Defect Prediction

Comparative Study of Various Hyperparameter Tuning on Random Forest Classification With SMOTE and Feature Selection Using Genetic Algorithm in Software Defect Prediction

Smart Urban Cadastral Map Enrichment—A Machine Learning Method

Smart Urban Cadastral Map Enrichment—A Machine Learning Method

Feature Selection Techniques for Enhancing Credit Card Fraud Detection Performance: A Hybrid Metaheuristic Approach Using Nature-Inspired Algorithms

Abstract: The surge in credit card usage has led to a parallel increase in fraudulent transactions, necessitating advanced detection systems. Traditional methods encounter challenges with high-dimensional and imbalanced datasets. This paper proposes a comprehensive approach integrating metaheuristic algorithms and deep learning techniques to enhance fraud detection accuracy. The first contribution, the Rock Hyrax Swarm Optimization Feature Selection (RHSOFS) algorithm, draws inspiration from the collective behaviors of rock hyrax swarms to effectively select relevant features from high-dimensional datasets. RHSOFS identifies an optimal subset of features critical for fraud detection through supervised machine learning. Complementing this, the second contribution leverages a hybrid deep learning model. Beginning by organizing transactional data and constructing a Logical Graph of Behavior Profile (LGBP) to abstract transaction details, the Modified Butterfly Optimization Algorithm (MBOA) selects important features from the dataset. The hybrid model, integrating Convolutional Neural Networks (CNN) and Recurrent Neural Networks (RNN), establishes rational connections between transactional characteristics, enhancing detection performance. To evaluate the approach, comparative efficiency analyses against existing methods, including Differential Evolutionary Feature Selection (DEFS), Genetic Algorithm Feature Selection (GAFS), Particle Swarm Optimization Feature Selection (PSOFS), and Ant Colony Optimization Feature Selection (ACOFS), are conducted. Results demonstrate the superiority of the approach in terms of both reliability and recognition rate, validated through rigorous statistical testing. The proposed hybrid approach signifies a significant advancement in credit card fraud detection systems, offering enhanced accuracy and efficiency in combating fraudulent activities amidst the growing complexity of transactional datasets.

Variable Selection for Recurrent Events Using Heuristic Approaches: Identifying Informative Variables for Rehospitalization in Schizophrenia Patients

Introduction: Recurrent event data, as a generalization of survival data, are frequently observed in various areas of medical research, including sequential hospitalizations in patients with schizophrenia. As experiencing multiple relapses during schizophrenia can have many implications, such as self-harm or harm to others, loss of education or employment, or other adverse outcomes, identifying and determining the most critical factors related to relapses in this disorder is essential. This study aimed to utilize heuristic approaches for selecting predictor variables in the field of recurrent events with an application to schizophrenia disorder
 Methods: A two-step algorithm was employed to apply a combination of two variable selection methods, recursive feature elimination (RFE) and genetic algorithm feature selection (GAFS), and four modeling techniques: Gradient boosting (GB), artificial neural network (ANN), random forest (RF), and support vector machine (SVM) to simulated recurrent event datasets.
 Results: In most simulation scenarios, the results indicated that the combination of RFE and RF applied to the deviance residual (DR) outperforms the other methods. The RFE-RF-DR selected the following predictor variables: Number of children, age, marital status, and history of substance abuse.
 Conclusion: Our findings revealed that the proposed machine learning-based model is a promising technique for selecting predictor variables associated with a recurrent outcome when analyzing multivariate time-toevent data with recurrent events.

Genetic algorithm for feature selection in mammograms for breast masses classification

ABSTRACT This paper introduces a Computer-Aided Detection (CAD) system for categorizing breast masses in mammogram images from the DDSM database as Benign, Malignant, or Normal. The CAD process involves Pre-processing, Segmentation, Feature Extraction, Feature Selection, and Classification. Three feature selection methods, namely the Genetic Algorithm (GA), t-test, and Particle Swarm Optimization (PSO) are used. In the classification phase, three machine learning algorithms (kNN, multiSVM, and Naive Bayes) are explored. Evaluation metrics like accuracy, AUC, precision, recall, F1-score, MCC, Dice coefficient, and Jaccard coefficient are used for performance assessment. Training and testing accuracy are assessed for the three classes. The system is evaluated using nine algorithm combinations, producing the following AUC values: GA+kNN (0.93), GA+multiSVM (0.88), GA+NB (0.91), t-test+kNN (0.91), t-test+multiSVM (0.86), t-test+NB (0.89), PSO+kNN (0.89), PSO+multiSVM (0.85), and PSO+NB (0.86). The study shows that the GA and kNN combination outperforms others.

Machine Learning Model For Stunting Prediction

This study aims to find the best Supervised Machine Learning (SML) model for stunting prediction. This research was conducted using an experimental approach using 192 infant data with a composition of 183 normal infant data and 9 stunted infant data using a custom dataset. The conclusion obtained from this study can be concluded that the combination of the Random Forest classification algorithm with Support Vector Machine Weighting and the Genetic Algorithm Feature Selection has the best performance. The parameters with the best performance are: The training and testing data distribution is 90% of the training data and 10% of the testing data. The number of trees in the random forest algorithm is 100, and the Gain Ratio criterion and max_depth is 10. In the Genetic Algorithm, the best parameters are: The Roulette Wheel selection method, the population is 20, the mutation value is 0.03, and the crossover value is 0.9. The validation method uses k-fold cross validation with a value of k = 10. Another conclusion is that there are 44 supporting factors for stunting, which, if we take a ranking of 10 in order of magnitude from largest to smallest, the supporting factors for stunting are 1.Baby's weight at birth. 2.Baby’s Height at Birth. 3.Number of meal per day. 4.Breast Milk. 5.Diarrhe times per 3 month. 6.Child development examination during covid by Health Worker at home. 7.Mother's age at birth. 8.Mother height at birth. 9.Number of sibling. 10.Age when the first food was given. This research has the disadvantage of no test on other datasets. So researchers do not know the reliability of findings is on different datasets

Chirplet transform based time frequency analysis of speech signal for automated speech emotion recognition

Nowadays, the recognition of emotion using the speech signal has gained popularity because of its vast number of applications in different fields like medicine, online marketing, online search engines, the education system, criminal investigations, traffic collisions, etc. Many researchers have adopted different methodologies to improve emotion classification accuracy using speech signals. In our study, time–frequency (TF) analysis-based features were used to analyze the emotion classification performance. We used a novel TF analysis method called the chirplet transform (CT) to find the TF matrix of the speech signal. We then calculated the proposed TF-based permutation entropy (TFPE) feature using the TF matrix of the speech signal. To reduce the feature dimension and select the most informative emotional feature, we employed the genetic algorithm (GA) feature selection method. Then, the selected TFPE features are used as input to machine learning classifiers such as SVM, RF, DT, and KNN to classify the emotions in the speech signal. We obtained classification accuracy of 77.2%, 69.57%, 68.78%, 56.9%, and 99.1% for the EMO-DB, EMOVO, SAVEE, IEMOCAP, and TESS datasets without the GA feature selection method. The emotion classification accuracy increased to 85.6%, 78.33%, 77.76%, 63.15%, and 100% with the GA feature selection method. We compared our results with other methods and found that our method performed better in emotion classification than the state-of-the-art methods.

High-Efficient Memristive Genetic Algorithm for Feature Selection

High-Efficient Memristive Genetic Algorithm for Feature Selection

Performance Optimization and Comprehensive Analysis of Binary Nutcracker Optimization Algorithm: A Case Study of Feature Selection and Merkle–Hellman Knapsack Cryptosystem

In this paper, a binary variant of a novel nature-inspired metaheuristic algorithm called the nutcracker optimization algorithm (NOA) is presented for binary optimization problems. Because of the continuous nature of the classical NOA and the discrete nature of the binary problems, two different families of transfer functions, namely S-shaped and V-shaped, are extensively investigated for converting the classical NOA into a binary variant, namely BNOA, applicable for various binary problems. Additionally, BNOA is improved using a local search strategy based on effectively integrating some genetic operators into the BNOA’s exploitation and exploration; this additional variant is called BINOA. Both BNOA and BINOA are evaluated using three common binary optimization problems, including feature selection, 0-1 knapsack, and the Merkle–Hellman knapsack cryptosystem (MHKC), and are compared to several robust binary metaheuristic optimizers in terms of statistical information, statistical tests, and convergence speed. The experiential findings show that BINOA is better than the classical BNOA and the other rival optimizers for both the 0-1 knapsack problem and attacking MHKC and is on par with some algorithms, like the genetic algorithm for feature selection.

Öznitelik Seçim Yöntemlerinin Toplam Ekipman Etkinliği Tahmin Başarısı Üzerindeki Etkisinin Araştırılması

Overall equipment effectiveness (OEE) describes production efficiency by combining availability, performance, and quality and is used to evaluate production equipment’s performance. This research’s aim is to investigate the potential of the feature selection techniques and the multiple linear regression method, which is one of the machine learning techniques, in successfully predicting the OEE of the corrugated department of a box factory. In the study, six different planned downtimes and information on seventeen different previously known concepts related to activities to be performed are used as input features. Moreover, backward elimination, forward selection, stepwise selection, correlation-based feature selection (CFS), genetic algorithm, random forest, extra trees, ridge regression, lasso regression, and elastic net feature selection methods are proposed to find the most distinctive feature subset in the dataset. As a result of the analyses performed on the data set consisting of 23 features, 1 output and 1204 working days of information, the elastic net - multiple linear regression model, which selects 19 attributes, gave the best average R2 value compared to other models developed. Occam's razor principle is taken into account since there is not a great difference between the average R2 values obtained. Among the models developed according to the principle, the stepwise selection - multiple linear regression model yielded the best R2 value among those that selected the fewest features.

Hybrid Filter-Genetic Feature Selection Method For Arabic Sentiment Analysis

The dramatic increase in user comments describing their feelings about products, services, and events brings sentiment analysis to the forefront as a way to monitor public opinion about products and events. Feature selection is an important subtask of sentiment analysis, which aims to improve the performance of learning algorithms and reduce the dimensionality of a problem. Feature selection is an important subtask of sentiment analysis, as it can improve the performance of learning algorithms while reducing the dimensionality of a problem. Moreover, the high-dimensional feature spaces caused by the morphological richness of Arabic motivate further research in this area. In this paper, a hybrid filter-based and genetic feature selection algorithm is proposed using four machine learning algorithms, namely decision tree, Naive-Bayes, K-NN and meta-ensemble methods. The performance of the proposed algorithm is compared with the performance of baseline models. A wide range of experiments are conducted on two standard Arabic datasets. The experimental results clearly show that the improved methods outperform the other baseline models for Arabic sentiment analysis. The results show that the improved models outperform traditional approaches in terms of classification accuracy, with a 5% increase in the macro average of F1.

Coastal Sentiment Review Using Naïve Bayes with Feature Selection Genetic Algorithm

Coastal Sentiment Review Using Naïve Bayes with Feature Selection Genetic Algorithm

Recognition of Disease in Leaves Using Genetic Algorithm and Neural Network Based Feature Selection

Objectives : To suggest a suitable image recognition approach for the early recognition of leaf diseases using hybrid features with genetic algorithm and neural network feature selection technique to maximize the accuracy. Methods: Various image processing techniques are utilized to recognize disease in the leaf. In the pre-processing phase, CNN based de-noising is utilized to remove noise from the image. Next, disease part of the leaf is segmented by Pixel wise Classification approach with an optimization technique. Then, the colour and the segmented area of an image is used to remove out texture features. With GLCM and SIFT technique. Then the appropriate features are selected by Genetic Algorithm and Neural Network based feature selection. Extracted features are classified using an Ensemble classifier for recognizing disease in the leaf. For this experiment images are taken from the plant village data set. In this work, the disease caused by Alternaria solani and Pytopthara infestans pathogens is considered for recognizing the disease in the leaf. 1500 leaves are used. From each image, 1654 features are extracted. There is a 70% training and 30% test data split. Classification accuracy, precision and recall measures are considered for evaluating the proposed work’s performance. Findings: The proposed work gives 97.7% classification accuracy, 97.3% precision and 97.5% recall measures with various visual feature descriptors and GANN feature selection. Novelty: The in-depth investigation compares the proposed descriptor GANN_SVM and GANN ES detection and classification technique to local and global SVMs. The suggested descriptor outperforms current approaches for diagnosing Alternaria solani and Pytopthara infestans leaves and the method can be applied to all plants infected leaves. Keywords: Genetic Algorithm; Leaf disease detection; Image processing; Neural Network; ensemble classifier

Cross‐project defect prediction method based on genetic algorithm feature selection

AbstractWith the continuous development of Internet technology, the role of software in life is increasing, and software defect prediction (SDP) is a key means to ensure software reliability. SDP is to predict the modules that may have defects in advance based on the historical data of software projects, and its purpose is to maximize the use of testing resources. However, in the actual development process, the project that needs to be predicted is often a new project for which there is little or no historical data. Therefore, how to use the massive data of other related projects to build a cross‐project software defect prediction (CPDP) model has received extensive attention from scholars. However, due to the differences in data distribution and class imbalance between different projects, the performance of CPDP is greatly affected. Therefore, on the basis of CPDP, this article proposes a feature selection method based on genetic algorithm (genetic algorithm feature selection, GAFS). GAFS mainly includes two stages: feature selection and ensemble training. In the feature selection stage, this article proposes a global search adaptive feature selection method based on genetic algorithm, which uses the integrated training results of candidate feature subsets on target data to migrate the optimal feature subset. In the ensemble training phase, the EasyEnsemble method is used to alleviate the class imbalance problem, multiple naive Bayesian classifiers are constructed, and then the final model is constructed through ensemble learning. In this article, F1‐score and MCC are used as the test indicator, and comparative experiments are carried out on AEEEM and Promise. The results show that compared with the five comparison methods, GAFS can improve the average F1‐score and MCC much more. For example, GAFS can improve the average F1‐score value by 38.9%, 31.6%, 35.1%, 22.0%, and 31.6%, respectively. In most cases, it can effectively improve the performance of the model and achieve better prediction results.

Detecting Android Malware with an Enhanced Genetic Algorithm for Feature Selection and Machine Learning

Detecting Android Malware with an Enhanced Genetic Algorithm for Feature Selection and Machine Learning

Customer Classification Using Naive Bayes Classifier With Genetic Algorithm Feature Selection

There is a tendency to decrease the number of speedy customers in the operational area of ​​North Sumatra due to customer dissatisfaction. Termination of employment is carried out by the customer against PT. Telekomunikasi Indonesia, Tbk in North Sumatra. There is no management of customer data classification so that classification information based on certain product purchases cannot be known. Naïve Bayes is a classification algorithm that is easy to use but has weaknesses which result in poor performance, therefore feature selection is needed, the genetic algorithm is an algorithm that is able to select attributes in research, will be selected based on the highest weight so that the accuracy of the prediction results is more optimal. The steps taken in the measurement model using the Naive Bayes Classifier (NBC) approach and the model using the GA-NBC approach obtained accurate results from cross validation measurements, Confusion Matrix, ROC curves for the classification of existing and speedy telephone subscribers. The stages of the Naive Bayes process are: data collection, data preprocessing, processing of the Naive Bayes Classifier algorithm. Then the results are validated and evaluated using the Text Mining Algorithm, and calculating the parameters based on the genetic algorithm. The accuracy produced by the Naive Bayes Classifier model is 85.08%. The accuracy produced by the Naive Bayes Classifier model with the selection of Genetic Algorithm features increased to 89.31%.

A Day-Ahead Short-Term Load Forecasting Using M5P Machine Learning Algorithm along with Elitist Genetic Algorithm (EGA) and Random Forest-Based Hybrid Feature Selection

A hybrid feature selection (HFS) algorithm to obtain the optimal feature set to attain optimal forecast accuracy for short-term load forecasting (STLF) problems is proposed in this paper. The HFS employs an elitist genetic algorithm (EGA) and random forest method, which is embedded in the load forecasting algorithm for online feature selection (FS). Using selected features, the performance of the forecaster was tested to signify the utility of the proposed methodology. For this, a day-ahead STLF using the M5P forecaster (a comprehensive forecasting approach using the regression tree concept) was implemented with FS and without FS (WoFS). The performance of the proposed forecaster (with FS and WoFS) was compared with the forecasters based on J48 and Bagging. The simulation was carried out in MATLAB and WEKA software. Through analyzing short-term load forecasts for the Australian electricity markets, evaluation of the proposed approach indicates that the input feature selected by the HFS approach consistently outperforms forecasters with larger feature sets.

Genetic algorithm for feature selection of EEG heterogeneous data

Overview:The electroencephalographic (EEG) signals provide highly informative data on brain activities and functions. Therefore, it is possible to extract a great variety of features from these data. Problem:The heterogeneity and high dimensionality of the EEG signals may represent an obstacle for data interpretation. The introduction of a priori knowledge has been widely employed to mitigate high dimensionality problems, even though it could lose some information and patterns present in the data. Moreover, data heterogeneity remains an open issue that often makes generalization difficult. Methods:In this study, we propose the adoption of a Genetic Algorithm (GA) for feature selection, where we introduced a series of modifications on the stopping criteria and fitness functions only and that can be used with a supervised or unsupervised approach. Our proposal considers three different fitness functions without relying on expert knowledge. Starting from two publicly available datasets on cognitive workload and motor movement/imagery, the EEG signals are processed, normalized and their features computed in the time, frequency and time–frequency domains. The feature vector selection is performed by applying our GA proposal and compared with two benchmarking techniques, i.e., using the entire feature set and reducing it through principal component analysis. Results & Conclusions:Our proposal experiments achieve better results in respect to the benchmark in terms of overall performance and feature reduction. Moreover, the application of our novel fitness function outperforms the benchmark when the two considered datasets are merged together, showing the effectiveness of our proposal on heterogeneous data. The selected features are compliant with the neuroscientific literature regarding the considered experimental conditions. Future works will focus on providing a better scoring for the unsupervised technique, the hybrid use of the two approaches and the optimization of the GA parameters.