Optimal Feature Selection Method Research Articles

Multi-source transfer learning via optimal transport feature ranking for EEG classification

Motor imagery (MI) brain-computer interface (BCI) paradigms have been extensively used in neurological rehabilitation. However, due to the required long calibration time and non-stationary nature of electroencephalogram (EEG) signals, it is challenging to obtain a substantial sample size of EEG data. Transfer learning (TL), which leverages knowledge from existing subjects to enhance the learning performance in new subjects, has been employed to solve this problem. Previous studies often extract sample features directly from the two domains for transfer learning, leading to poor features and negative transfer. To overcome this limitation, an optimal transport feature selection method was developed in this study to select the most suitable features for migration to enhance the generalization capability of the TL. This was achieved by analyzing the diagonal value similarity of the optimal transport coupling matrix. First, the Riemannian tangent space mapping method was used to map the sample covariance matrix of EEG trials from the Riemannian manifold to tangent space. Secondly, the optimal subset of EEG features was selected via the optimal transport feature selection method. Subsequently, the separate distribution alignment method was employed to minimize dissimilarities between the source and target domains. Finally, the weighted voting mechanisms were integrated for decision fusion. The proposed multi-source transfer feature learning (MSTFL) method was validated based on two public BCI Competition IV datasets. Our results demonstrated superior classification accuracy of 85.93% and 79.48%, respectively, on the two public datasets, compared to state-of-the-art models. These findings indicate the effectiveness of our proposed MSTFL model for both feature extraction and classification of MI signals.

Enhancing speech emotion recognition through deep learning and handcrafted feature fusion

In this paper, we introduce an innovative investigation in speech emotion recognition (SER). The proposed model combines deep learning-based and handcrafted audio features to achieve optimal accuracy. The proposed model employs an iterative feature selection and majority voting pipeline to obtain better results by fusing deep learning-based and handcrafted features. The wav2vec2 model and the openSmile audio processing library are used in order to extract audio features from audio data. Then the feature selection and majority voting techniques are used to identify the optimal feature selection methods for diverse feature sets and to combine their strengths. The experiments are performed using a diverse and extensive corpus to ensure the robustness of the proposed method. In the construction of this multi-corpus dataset, we used four well-known benchmark datasets, namely Ravdess, Savee, Crema-D, and Tess. All of these datasets are publicly available. These datasets are combined on six common emotions: sadness, happiness, fear, anger, surprise, and disgust. The resultant dataset comprises 11,511 samples across these categories. The proposed method has been shown to achieve results comparable to those reported in the existing literature. The experimental results indicate that the proposed pipeline leads to a 3 % improvement in classification accuracy. The highest achieved accuracy on the multi-corpus dataset is 92.55 %.

Combinations of Feature Selection and Machine Learning Models for Object-Oriented “Staple-Crop-Shifting” Monitoring Based on Gaofen-6 Imagery

This paper combines feature selection with machine learning algorithms to achieve object-oriented classification of crops in Gaofen-6 remote sensing images. The study provides technical support and methodological references for research on regional monitoring of food crops and precision agriculture management. “Staple-food-shifting” refers to the planting of other cash crops on cultivated land that should have been planted with staple crops such as wheat, rice, and maize, resulting in a change in the type of arable land cultivated. An accurate grasp of the spatial and temporal patterns of “staple-food-shifting” on arable land is an important basis for rationalizing land use and protecting food security. In this study, the Shihezi Reclamation Area in Xinjiang is selected as the study area, and Gaofen-6 satellite images are used to study the changes in the cultivated area of staple food crops and their regional distribution. Firstly, the images are segmented at multiple scales and four types of features are extracted, totaling sixty-five feature variables. Secondly, six feature selection algorithms are used to optimize the feature variables, and a total of nine feature combinations are designed. Finally, k-Nearest Neighbor (KNN), Random Forest (RF), and Decision Tree (DT) are used as the basic models of image classification to explore the best combination of feature selection method and machine learning model suitable for wheat, maize, and cotton classification. The results show that our proposed optimal feature selection method (OFSM) can significantly improve the classification accuracy by up to 15.02% compared to the Random Forest Feature Importance Selection (RF-FI), Random Forest Recursive Feature Elimination (RF-RFE), and XGBoost Feature Importance Selection (XGBoost-FI) methods. Among them, the OF-RF-RFE model constructed based on KNN performs the best, with the overall accuracy, average user accuracy, average producer accuracy, and kappa coefficient reaching 90.68%, 87.86%, 86.68%, and 0.84, respectively.

MRI radiomics based machine learning model of the periaqueductal gray matter in migraine patients.

<p>The aim of the study was to investigate the question: Can MRI radiomics analysis of the periaqueductal gray region elucidate the pathophysiological mechanisms underlying various migraine subtypes, and can a machine learning model using these radiomics features accurately differentiate between migraine patients and healthy individuals, as well as between migraine subtypes, including atypical cases with overlapping symptoms?</p>. <p>The study analyzed initial MRI images of individuals taken after their first migraine diagnosis, and additional MRI scans were acquired from healthy subjects. Radiomics modeling was applied to analyze all the MRI images in the periaqueductal gray region. The dataset was randomized, and oversampling was used if there was class imbalance between groups. The optimal algorithm-based feature selection method was employed to select the most important 5-10 features to differentiate between the two groups. The classification performance of AI algorithms was evaluated using receiver operating characteristic analysis to calculate the area under the curve, classification accuracy, sensitivity, and specificity values. Participants were required to have a confirmed diagnosis of either episodic migraine, probable migraine, or chronic migraine. Patients with aura, those who used migraine-preventive medication within the past six months, or had chronic illnesses, psychiatric disorders, cerebrovascular conditions, neoplastic diseases, or other headache types were excluded from the study. Additionally, 102 healthy subjects who met the inclusion and exclusion criteria were included.&nbsp;</p>. <p>The algorithm-based information gain method for feature reduction had the best performance among all methods, with the first-order, gray-level size zone matrix, and gray-level co-occurrence matrix classes being the dominant feature classes. The machine learning model correctly classified 82.4% of migraine patients from healthy subjects. Within the migraine group, 74.1% of the episodic migraine-probable migraine patients and 90.5% of the chronic migraine patients were accurately classified. No significant difference was found between probable migraine and episodic migraine patients in terms of the periaqueductal gray region radiomics features. The kNN algorithm showed the best performance for classifying episodic migraine-probable migraine subtypes, while the Random Forest algorithm demonstrated the best performance for classifying the migraine group and chronic migraine subtype.</p>. <p>A radiomics-based machine learning model, utilizing standard MR images obtained during the diagnosis and follow-up of migraine patients, shows promise not only in aiding migraine diagnosis and classification for clinical approach, but also in understanding the neurological mechanisms underlying migraines.&nbsp;</p>.

Machine Learning Predicts Decompression Levels for Lumbar Spinal Stenosis Using Canal Radiomic Features from Computed Tomography Myelography.

The accurate preoperative identification of decompression levels is crucial for the success of surgery in patients with multi-level lumbar spinal stenosis (LSS). The objective of this study was to develop machine learning (ML) classifiers that can predict decompression levels using computed tomography myelography (CTM) data from LSS patients. A total of 1095 lumbar levels from 219 patients were included in this study. The bony spinal canal in CTM images was manually delineated, and radiomic features were extracted. The extracted data were randomly divided into training and testing datasets (8:2). Six feature selection methods combined with 12 ML algorithms were employed, resulting in a total of 72 ML classifiers. The main evaluation indicator for all classifiers was the area under the curve of the receiver operating characteristic (ROC-AUC), with the precision-recall AUC (PR-AUC) serving as the secondary indicator. The prediction outcome of ML classifiers was decompression level or not. The embedding linear support vector (embeddingLSVC) was the optimal feature selection method. The feature importance analysis revealed the top 5 important features of the 15 radiomic predictors, which included 2 texture features, 2 first-order intensity features, and 1 shape feature. Except for shape features, these features might be eye-discernible but hardly quantified. The top two ML classifiers were embeddingLSVC combined with support vector machine (EmbeddingLSVC_SVM) and embeddingLSVC combined with gradient boosting (EmbeddingLSVC_GradientBoost). These classifiers achieved ROC-AUCs over 0.90 and PR-AUCs over 0.80 in independent testing among the 72 classifiers. Further comparisons indicated that EmbeddingLSVC_SVM appeared to be the optimal classifier, demonstrating superior discrimination ability, slight advantages in the Brier scores on the calibration curve, and Net benefits on the Decision Curve Analysis. ML successfully extracted valuable and interpretable radiomic features from the spinal canal using CTM images, and accurately predicted decompression levels for LSS patients. The EmbeddingLSVC_SVM classifier has the potential to assist surgical decision making in clinical practice, as it showed high discrimination, advantageous calibration, and competitive utility in selecting decompression levels in LSS patients using canal radiomic features from CTM.

Feature redundancy removal for text classification using correlated feature subsets

AbstractThe curse of high dimensionality in text classification is a worrisome problem that requires efficient and optimal feature selection (FS) methods to improve classification accuracy and reduce learning time. Existing filter‐based FS methods evaluate features independently of other related ones, which can then lead to selecting a large number of redundant features, especially in high‐dimensional datasets, resulting in more learning time and less classification performance, whereas information theory‐based methods aim to maximize feature dependency with the class variable and minimize its redundancy for all selected features, which gradually becomes impractical when increasing the feature space. To overcome the time complexity issue of information theory‐based methods while taking into account the redundancy issue, in this article, we propose a new feature selection method for text classification termed correlation‐based redundancy removal, which aims to minimize the redundancy using subsets of features having close mutual information scores without sequentially seeking already selected features. The idea is that it is not important to assess the redundancy of a dominant feature having high classification information with another irrelevant feature having low classification information and vice‐versa since they are implicitly weakly correlated. Our method, tested on seven datasets using both traditional classifiers (Naive Bayes and support vector machines) and deep learning models (long short‐term memory and convolutional neural networks), demonstrated strong performance by reducing redundancy and improving classification compared to ten competitive metrics.

Impurity-Based Important Features for feature selection in Recursive Feature Elimination for Stock Price Forecasting

Stock investors perform stock price forecasting based on technical indicators and historical stock prices. The large number of technical indicators and historical data often leads to overfitting and ambiguity in forecasting using machine learning. In this paper, we proposed a feature selection approach using impurity-based important features in recursive feature elimination for stock price forecasting. The data utilized includes historical data and various moving averages. Feature selection is employed to reduce the number of features and obtain important and relevant features. The recursive feature elimination with impurity-based important features is utilized as the feature selection method. The machine learning methods employed are linear regression, support vector regression, multi-layer perceptron regression, and random forest regression. The measurement results of mean squared error (mse), root mean squared error (rmse), mean absolute error (mae), and mean absolute percentage error (mape) show that the optimal feature selection and machine learning method is achieved with six features and linear regression. The average mse, rmse, mae, and mape values are 0.000279, 0.016577, 0.012843, and 1.42236%, respectively. These results validate the effectiveness of impurity-based important features for feature selection in recursive feature elimination using historical data and various moving averages in stock price forecasting.

Feature Construction Using Persistence Landscapes for Clustering Noisy IoT Time Series

With the advancement of IoT technologies, there is a large amount of data available from wireless sensor networks (WSN), particularly for studying climate change. Clustering long and noisy time series has become an important research area for analyzing this data. This paper proposes a feature-based clustering approach using topological data analysis, which is a set of methods for finding topological structure in data. Persistence diagrams and landscapes are popular topological summaries that can be used to cluster time series. This paper presents a framework for selecting an optimal number of persistence landscapes, and using them as features in an unsupervised learning algorithm. This approach reduces computational cost while maintaining accuracy. The clustering approach was demonstrated to be accurate on simulated data, based on only four, three, and three features, respectively, selected in Scenarios 1–3. On real data, consisting of multiple long temperature streams from various US locations, our optimal feature selection method achieved approximately a 13 times speed-up in computing.

COMPARISON OF FEATURE SELECTION TO PERFORMANCE IMPROVEMENT OF K-NEAREST NEIGHBOR ALGORITHM IN DATA CLASSIFICATION

One of the most widely used data classification methods is the K-Nearest Neighbor (K-NN) algorithm. Classification of data in this method is carried out based on the calculation of the closest distance to the training data as much as the value of K from its neighbors. Then the new data class is determined using the most votes system from the number of K nearest neighbors. However, the performance of this method is still lower than other data classification methods. The cause is the use of the most voting system in determining new data classes and the influence of features less relevant to the dataset. This study compares several feature selection methods in the data set to see their effects on the performance of the K-NN algorithm in data classification. The feature selection methods in this research are Information gain, Gain ratio, and Gini index. The method was tested on the Water Quality dataset from the Kaggle Repository to see the most optimal feature selection method. The test results on the dataset show that the use of the feature selection method affects to increase the performance of the K-NN algorithm. The average increase in the accuracy value obtained from the value of K=1 to K=15 is the Information Gain increased by 1.17%, Gain ratio increased by 0.69%, and the Gini index increased by 1.19%. The highest accuracy value in the classification of the Water Quality dataset is 89.66% at K=13 with the Information Gain feature selection method.

Improving soil organic matter estimation accuracy by combining optimal spectral preprocessing and feature selection methods based on pXRF and vis-NIR data fusion

Rapid and accurate estimation of soil organic matter (SOM) content is of great significance for agricultural production and carbon stock estimation. Visible-near-infrared spectroscopy (Vis-NIR) and portable X-ray fluorescence spectroscopy (pXRF), with the fast, low-cost, and environmental friendly characteristics, can realize the rapid large-scale detection of SOM. However, due to the heterogeneity and complexity of soil, estimation of SOM using a single sensor often leads to high uncertainty in result. Multi-sensor data fusion is one of the approaches to solve this problem, but suitable spectral preprocessing methods and data fusion methods still need further research. In this study, 500 soil samples were collected from two watersheds with large differences in soil parent material, soil type, and climate in the Xinjiang Uygur Autonomous Region of China. The effects of different spectral preprocessing methods for vis-NIR and pXRF spectra on SOM estimation were compared, and the effects of five feature selection methods on single sensor estimation and three different multi-sensor fusion estimations were evaluated. The results showed that vis-NIR spectrum was better than pXRF spectrum for SOM estimation, and the 1.6th-order derivative and baseline correction were the optimal preprocessing method for vis-NIR and pXRF spectra (Beam 3), respectively. Feature selection could improve the accuracy of the single sensor and multi-sensor fusion estimations. The competitive adaptive reweighted sampling (CARS) method was the optimal feature selection method for single sensor estimation and Granger–Ramanathan averaging (GRA) fusion estimation, and the variable importance in projection (VIP) was the optimal feature selection method for direct concatenation and outer-product analysis fusion estimation. In general, the optimal SOM estimation (RMSEp = 3.59 g kg−1, LCCCp = 0.84, RPIQp = 2.67) could be achieved based on CARS feature selection method and GRA fusion. This study proves that the combination of spectral preprocessing and feature selection can effectively improve the accuracy of the single sensor and multi-sensor fusion estimations. Especially, the multi-sensor fusion estimation has higher accuracy than the single sensor estimation. This study will provide a reference for the application of proximal soil sensing.

An Optimized Feature Selection Method for E-Learning Recommender System Using Deep Neural Network based on Multilayer Perceptron

An Optimized Feature Selection Method for E-Learning Recommender System Using Deep Neural Network based on Multilayer Perceptron

An Optimized Feature Selection Method Using Ensemble Classifiers in Software Defect Prediction for Healthcare Systems

The healthcare systems are extensively being used with increased focus on safety of patients. Software engineering for healthcare applications is an emerging research area. Detecting defects is a critical step of software development process of healthcare applications. The performance of the Software Defect Prediction model (SDP) depends on the features of healthcare system; irrelevant features decrease the performance of the model. An optimized feature selection technique is needed to recognize and remove the irrelevant features. In this study, a new optimized feature selection technique, i.e., multiobjective Harris Hawk Optimization (HHO), is proposed for binary classification problem with Adaptive Synthetic Sampling (ADASYN) Technique. Multiobjective HHO is proposed with two main objectives, one to reduce the total amount of selected features and the other to maximize the performance of the proposed model. The multiobjective feature selection technique helps to find the optimal solution to achieve the desired objectives and increase the classification performance in terms of accuracy, AUC, precision, recall, and F1-measure. The study conducts an experiment on a healthcare dataset. Six different search techniques (RF, SVM, bagging, adaptive boosting, voting, and stacking) are implemented on the dataset. The proposed model helps to predict the software defects with a significant classification accuracy of 0.990 and AUC score of 0.992.

Tumor Detection on Microarray Data Using Grey Wolf Optimization with Gain Information

Microarray data are becoming a more essential source of gene expression data for interpretation and analysis. To improve the detection accuracy of tumors, the researchers try to use the lowest feasible collection of the most gene expression studies, and relevant gene expression patterns are found. The purpose of this article is to use a data mining strategy and an optimized feature selection method focused on a limited dense tree forest classifier to evaluate and forecast colon cancer data. More specifically, merging the “gain information” and “Grey wolf optimization” was incorporated as a feature selection approach into the random forest classifier, to improve the prediction model’s accuracy. Our suggested technique can decrease the load of high-dimensional data, and it allows quicker computations. In this research, we provided a comparison of the analysis model with feature selection accuracy over model analysis without feature selection accuracy. The extensive experimental findings have shown that the suggested method with selecting features is beneficial, outperforming the good classification performances.

Incipient Residual-Based Anomaly Detection in Power Electronic Devices

Power electronics (PE) and high-frequency switching circuits are key to superior performance of electric vehicles. It is vital to monitor the condition of the PE components in real-time for safety and reliability. In this article, we propose two anomaly detection methods based on a combination of data preprocessing to suppress noise and outliers, multivariate regression models to predict signals of interest under nominal operation, and sequential analysis of residuals. In particular, the methods utilize median filtering to extract <sc xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">on</small> -state medians in each switching cycle in nonlinear autoregressive exogenous neural network models or filtered <sc xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">on</small> -state data in partial least squares-based models to represent the nominal circuit behavior. Optimal and approximate dynamic programming-based feature selection methods are developed to select the most informative signals or their transformations. Predictions from the learned models are used to generate the residuals for anomaly detection by Page’s cumulative sum test. The proposed models and anomaly detection methods are validated on three accelerated aging experimental datasets, comprised of 60 power <sc xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">mosfet</small> devices with low-frequency and high-frequency switching under disparate operating conditions. Due to the simplicity and efficiency of the data-driven anomaly detection schemes, the proposed methods can potentially be embedded in real-time digital platforms.

Optimized feature selection method using particle swarm intelligence with ensemble learning for cancer classification based on microarray datasets

Optimized feature selection method using particle swarm intelligence with ensemble learning for cancer classification based on microarray datasets

Particle ranking: An Efficient Method for Multi-Objective Particle Swarm Optimization Feature Selection

This paper presents a novel multi-objective particle swarm optimization feature selection method. For this task, feature vectors are decoded as particles and ranked in a two-dimensional optimization space. To rank a particle, optimization space is modeled as two bands of dominated and non dominated particles with respect to that particle. Furthermore, uniform and nonuniform distributions of particles in optimization space as well as main properties of the proposed model are analyzed mathematically and experimentally in details. Beside particle ranks, feature ranks are also used to update velocity and position of particles in each iteration of optimization process.The proposed method has been evaluated in 16 datasets and compared with 11 state of the art feature selection and multi-objective optimization methods. Visual experimental results show that the proposed method finds Pareto Fronts of the best particles close to origin in multi-objective optimization space. Quantitative experiments also show that the proposed method achieves: the best Success Counting Measure in 13 datasets, superior C-Metric in 14 datasets, the greatest Hyper-Volume Indicator in 13 datasets. Finally, results of pairwise Mann–Whitney U-test show that the proposed method is statistically better in 38 pairwise statistically tests out of 55 tests.

An improved lithology identification approach based on representation enhancement by logging feature decomposition, selection and transformation

As the accumulation of logging data and the enhancement of computational power, machine learning technology has been progressively applied to logging interpretation field such as lithology identification. However, in traditional data-driven lithology identification model, the implied variation information of logging curve and coupling relationships among features are not fully mined. Additionally, feature extraction cannot filter out information redundancy and noise. We propose logging data representation enhancement approach for lithology identification based on feature decomposition, selection and transformation, converting the raw logging curves into an improved high dimensional representation with more effective information and less noise. Local mean decomposition is used to extract the variation information of logging curves from multiple depth scales and add them to the features of adjacent samples. Considering the different contribution of features to lithology identification, an optimized feature selection method based on Shapley additive explanation is designed to reduce redundant and noisy information in logging data. To mine the complementary information among sequence features, a representation learning model integrating feature transformation and lithology classification is developed by multi-grained scanning and cascading extreme learning machine. The effectiveness and generalization of the proposed approach are verified on the baseline and shale oil field datasets. The results show that the proposed approach can make the logging data acquire more valid information through representation enhancement, which helps to achieve high-accuracy lithology identification.

Overall Survival Prognostic Modelling of Non-small Cell Lung Cancer Patients Using Positron Emission Tomography/Computed Tomography Harmonised Radiomics Features: The Quest for the Optimal Machine Learning Algorithm

AimsDespite the promising results achieved by radiomics prognostic models for various clinical applications, multiple challenges still need to be addressed. The two main limitations of radiomics prognostic models include information limitation owing to single imaging modalities and the selection of optimum machine learning and feature selection methods for the considered modality and clinical outcome. In this work, we applied several feature selection and machine learning methods to single-modality positron emission tomography (PET) and computed tomography (CT) and multimodality PET/CT fusion to identify the best combinations for different radiomics modalities towards overall survival prediction in non-small cell lung cancer patients. Materials and methodsA PET/CT dataset from The Cancer Imaging Archive, including subjects from two independent institutions (87 and 95 patients), was used in this study. Each cohort was used once as training and once as a test, followed by averaging of the results. ComBat harmonisation was used to address the centre effect. In our proposed radiomics framework, apart from single-modality PET and CT models, multimodality radiomics models were developed using multilevel (feature and image levels) fusion. Two different methods were considered for the feature-level strategy, including concatenating PET and CT features into a single feature set and alternatively averaging them. For image-level fusion, we used three different fusion methods, namely wavelet fusion, guided filtering-based fusion and latent low-rank representation fusion. In the proposed prognostic modelling framework, combinations of four feature selection and seven machine learning methods were applied to all radiomics modalities (two single and five multimodalities), machine learning hyper-parameters were optimised and finally the models were evaluated in the test cohort with 1000 repetitions via bootstrapping. Feature selection and machine learning methods were selected as popular techniques in the literature, supported by open source software in the public domain and their ability to cope with continuous time-to-event survival data. Multifactor ANOVA was used to carry out variability analysis and the proportion of total variance explained by radiomics modality, feature selection and machine learning methods was calculated by a bias-corrected effect size estimate known as ω2. ResultsOptimum feature selection and machine learning methods differed owing to the applied radiomics modality. However, minimum depth (MD) as feature selection and Lasso and Elastic-Net regularized generalized linear model (glmnet) as machine learning method had the highest average results. Results from the ANOVA test indicated that the variability that each factor (radiomics modality, feature selection and machine learning methods) introduces to the performance of models is case specific, i.e. variances differ regarding different radiomics modalities and fusion strategies. Overall, the greatest proportion of variance was explained by machine learning, except for models in feature-level fusion strategy. ConclusionThe identification of optimal feature selection and machine learning methods is a crucial step in developing sound and accurate radiomics risk models. Furthermore, optimum methods are case specific, differing due to the radiomics modality and fusion strategy used.

Optimal Feature Selection Methods for Chronic Kidney Disease Classification using Intelligent Optimization Algorithms

Aim: Recently, classification of medical data gives more importance to identify the existence of disease. Background: Numerous classification algorithms for chronic kidney disease (CKD) are developed and produced better classification results. But, the inclusion of different factors in the identification of CKD reduces the effectiveness of the employed classification algorithm. Objective: To overcome this issue, feature selection (FS) approaches are proposed to minimize the computational complexity and also to improve the classification performance in the identification of CKD. Since numerous bio-inspired based FS methodologies are developed, a need arises to examine the feature selection approaches performance of different algorithms on the identification of CKD. Method: This paper proposes a new framework for classification and prediction of CKD. Three feature selection approaches are used namely Ant Colony Optimization (ACO) algorithm, Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) in the classification process of CKD. Finally, logistic regression (LR) classifier is employed for effective classification. Results: The effectiveness of the ACO-FS, GA-FS and PSO-FS are validated by testing it against a benchmark CKD dataset. Conclusion: The empirical results state that the ACO-FS algorithm performs well and the results reported that the classification performance is improved by the inclusion of feature selection methodologies in CKD classification.

Metode Seleksi Fitur Untuk Klasifikasi Sentimen Menggunakan Algoritma Naive Bayes: Sebuah Literature Review

In the era of the industrial revolution 4.0 as it is today, where the internet is a necessity for people to live their daily lives. The high intensity of internet use in the community, it causes the distribution of information in it to spread widely and quickly. The rapid distribution of information on the internet is also in line with the growing growth of digital data, so that the public opinions contained therein become important things. Because, from this digital data, it can be processed with sentiment analysis in order to obtain useful information about issues that are developing in the community or to find out public opinion on a company's product. The number of studies related to sentiment analysis that applies the Naive Bayes algorithm to solve the problem, so researchers are interested in conducting research on the use of feature selection for the algorithm. Therefore, this research was conducted to determine what feature selection is the most optimal when combined with the Naive Bayes algorithm using the Systematic Literature Review (SLR) research method. The results of this study concluded that the most optimal feature selection method when combined with the Naive Bayes algorithm is the Particle Swarm Optimization (PSO) method with an average accuracy value of 89.08%.