EEG feature selection based on weighted-normalized mutual information for mental fatigue classification

Global navigation satellite systems (GNSS) are extensively utilized for military and civilian applications. Unfortunately, because of the signal weakness, GNSS is susceptible to interference, fading, and jamming, which reduces the position accuracy. Therefore, it would be beneficial to have a simple and highly accurate model for detecting the jamming signals to improve the GNSS receiver accuracy. In this paper, we propose a hybrid deep learning (DL) model for predicting jamming signals. Initially, we utilize a feature selection algorithm that combines mutual information (MI) with the minimal redundancy maximum relevance (mRMR) technique to identify the most crucial features. Subsequently, the model undergoes training using a soft attention-double-layer bidirectional long short-term memory (A-DBiLSTM) model. This particular model has shown outstanding performance in comparison to other DL models when applied to datasets collected from both kinematic and static jamming scenarios. To assess the effectiveness and efficiency of the proposed MI feature selection algorithm, we evaluate its performance through the calculation of confusion matrices and conducting numerical simulations. The simulation results of the A-DBiLSTM model demonstrate higher accuracy, precision, recall, and F1Score\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathrm {F1_{Score}}$$\\end{document} of 98.82%\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$98.82\\%$$\\end{document}, 98.4%\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$98.4\\%$$\\end{document}, 98.68%\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$98.68\\%$$\\end{document}, and 98.36%\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$98.36\\%$$\\end{document}, respectively. By employing the MI feature selection algorithm, dimensionality reduction is achieved. Moreover, the MI feature selection algorithm reduces 19%\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$19\\%$$\\end{document} of the learning time with almost the same accuracy.

Music holds a significant role in our daily lives, and its impact on emotions has been a focal point of research across various disciplines, including psychology, sociology, and statistics. Ongoing studies continue to explore this intriguing relationship. With advancing technology, the ability to choose from a diverse range of music has expanded. Recent trends highlight a growing preference for searching for music based on emotional attributes rather than individual preferences or genres. The act of selecting music based on emotional states is important on both a universal and cultural level. This study seeks to employ machine learning-based methods to classify four different music genres using a minimal set of features. The objective is to facilitate the process of choosing Turkish music according to one’s mood. The classification methods employed include Decision Tree, Random Forest (RF), Support Vector Machines (SVM), and k-Nearest Neighbor, coupled with the Mutual Information (MI) feature selection algorithm. Experimental results reveal that, with all features considered in the dataset, RF achieved the highest accuracy at 0.8098. However, when the MI algorithm was applied, SVM exhibited the best accuracy at 0.8068. Considering both memory consumption and accuracy, the RF method emerges as a favorable choice for selecting Turkish music based on emotional states. This research not only advances our understanding of the interaction between music and emotions but also provides practical insights for individuals who want to shape their music according to their emotional preferences.

Text classification has been highlighted as the key process to organize online texts for better communication in the Digital Media Age. Text classification establishes classification rules based on text features, so the accuracy of feature selection is the basis of text classification. Facing fast-increasing Chinese electronic documents in the digital environment, scholars have accumulated quite a few algorithms for the feature selection for the automatic classification of Chinese texts in recent years. However, discussion about how to adapt existing feature selection algorithms for various types of Chinese texts is still inadequate. To address this, this study proposes three improved feature selection algorithms and tests their performance on different types of Chinese texts. These include an enhanced CHI square with mutual information (MI) algorithm, which simultaneously introduces word frequency and term adjustment (CHMI); a term frequency–CHI square (TF–CHI) algorithm, which enhances weight calculation; and a term frequency–inverse document frequency (TF–IDF) algorithm enhanced with the extreme gradient boosting (XGBoost) algorithm, which improves the algorithm’s ability of word filtering (TF–XGBoost). This study randomly chooses 3000 texts from six different categories of the Sogou news corpus to obtain the confusion matrix and evaluate the performance of the new algorithms with precision and the F1-score. Experimental comparisons are conducted on support vector machine (SVM) and naive Bayes (NB) classifiers. The experimental results demonstrate that the feature selection algorithms proposed in this paper improve performance across various news corpora, although the best feature selection schemes for each type of corpus are different. Further studies of the application of the improved feature selection methods in other languages and the improvement in classifiers are suggested.

In healthcare, the Internet of Things (IoT) is used to remotely monitor patients and provide real-time diagnoses, which is referred to as the Internet of Medical Things (IoMT). This integration poses a risk from cybersecurity threats that can harm patient data and well-being. Hackers can manipulate biometric data from biosensors or disrupt the IoMT system, which is a major concern. To address this issue, intrusion detection systems (IDS) have been proposed, particularly using deep learning algorithms. However, developing IDS for IoMT is challenging due to high data dimensionality leading to model overfitting and degraded detection accuracy. Feature selection has been proposed to prevent overfitting, but the existing methods assume that feature redundancy increases linearly with the size of the selected features. Such an assumption does not hold, as the amount of information a feature carries about the attack pattern varies from feature to feature, especially when dealing with early patterns, due to data sparsity that makes it difficult to perceive the common characteristics of selected features. This negatively affects the ability of the mutual information feature selection (MIFS) goal function to estimate the redundancy coefficient accurately. To overcome this issue, this paper proposes an enhanced feature selection technique called Logistic Redundancy Coefficient Gradual Upweighting MIFS (LRGU-MIFS) that evaluates candidate features individually instead of comparing them with common characteristics of the already-selected features. Unlike the existing feature selection techniques, LRGU calculates the redundancy score of a feature using the logistic function. It increases the redundancy value based on the logistic curve, which reflects the nonlinearity of the relationship of the mutual information between features in the selected set. Then, the LRGU was incorporated into the goal function of MIFS as a redundancy coefficient. The experimental evaluation shows that the proposed LRGU was able to identify a compact set of significant features that outperformed those selected by the existing techniques. The proposed technique overcomes the challenge of perceiving common characteristics in cases of insufficient attack patterns and outperforms existing techniques in identifying significant features.

Feature selection plays a vital role in promoting classifier performance. However, current methods cannot effectively distinguish the complex interaction in the selected features. To further remove these hidden negative interactions, we propose a Genetic Algorithm (GA)-like Dynamic Probability (GADP) method with mutual information method (MI), which has a two-layer structure. The first layer applies MRMR to obtain a primary feature subset. Based on the former candidate features, the GADP, as the second layer, can mine more supportive features. Instead of the commonly used approaches that they frequently focus on improving the operators of GA to enhance the search ability and lowering the convergence time, we improve GA by boldly abandoning the operators and employing the dynamic probability that relies on the performance of each chromosome to determine feature selection in the new generation. The dynamic probability mechanism significantly reduces the parameter number in GA and makes it easy to use. As each gene's probability is independent, the chromosome variety in GADP is more notable than in traditional GA, which ensures GADP has a wider search space and can effectively and accurately select relevant features. To verify the superiority of our method, we evaluate it under multiple conditions on 15 datasets. The results demonstrate the outperformance of the proposed method. Generally, it has the best accuracy. Further, we also compare the proposed model to the state-of-the-art heuristic methods like Harris Hawk Optimization (HHO), Salp Swarm Algorithm (SSA), and White Shark Optimizer (WSO). Our model still owns advantages over them.

Based on benchmarking various methods and analyzing multiple real scRNA-seq datasets, a computational platform/workflow and a set of tips for best practices are developed for analyzing causal interactions or relationships in single cells.

PSOLDA: A particle swarm optimization approach for enhancing classification accuracy rate of linear discriminant analysis

Feature selection is one of the important research areas in pattern recognition. The aim of feature selection is to select those of informative features to improve the classifier's performance. In this paper, we propose a novel multi-objective algorithm based on mutual information for feature selection, called multi-objective mutual information (MOMI). The proposed method identifies a set of features with minimal redundancy and maximum relevancy with the target class. Several experiments are performed to evaluate the performance of MOMI compared to that of well-known and state-of-the-art feature selection methods over five benchmark datasets. The results show that in most cases MOMI achieves better classification performance than others.

Although the range of immune responses to severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) is variable, cytokine storm is observed in a subset of symptomatic individuals. To further understand the disease pathogenesis and, consequently, to develop an additional tool for clinicians to evaluate patients for presumptive intervention, we sought to compare plasma cytokine levels between a range of donor and patient samples grouped by a COVID-19 Severity Score (CSS) based on the need for hospitalization and oxygen requirement. Here we utilize a mutual information algorithm that classifies the information gain for CSS prediction provided by cytokine expression levels and clinical variables. Using this methodology, we found that a small number of clinical and cytokine expression variables are predictive of presenting COVID-19 disease severity, raising questions about the mechanism by which COVID-19 creates severe illness. The variables that were the most predictive of CSS included clinical variables such as age and abnormal chest x-ray as well as cytokines such as macrophage colony-stimulating factor, interferon-inducible protein 10, and interleukin-1 receptor antagonist. Our results suggest that SARS-CoV-2 infection causes a plethora of changes in cytokine profiles and that particularly in severely ill patients, these changes are consistent with the presence of macrophage activation syndrome and could furthermore be used as a biomarker to predict disease severity.

This paper is concerned with the selection of process variables and time lags for fault detection. For this purpose, a feature selection technique known as Successive Projections Algorithm (SPA) is employed with Linear Discriminant Analysis (LDA) classifiers to discriminate between normal operating conditions and faults. SPA was originally designed to minimize multicollinearity among the selected features, which is a known cause of generalization problems for LDA. In the present work, a modification to the basic SPA formulation is proposed to place larger emphasis on the selection of relevant features for the classification task. The proposed SPA-LDA methodology is illustrated in a case study involving the Tennessee Eastman benchmark process. For comparison, a genetic algorithm (GA) for feature selection is also employed. In this study, the pre-selection of process variables was found to improve the accuracy of the resulting classifiers. In practice, such a pre-selection would have the extra advantage of reducing the number of sensors required to detect a given fault. Moreover, the proposed modification in SPA-LDA resulted in an improvement of average classification accuracy from 88 % to 96 %. This result was similar to that obtained by GA-LDA (97 %). However, the SPA-LDA classifiers were found to be less sensitive to measurement noise.

In the present state of affairs, the motive behind every educational organization is to uplift the academic achievement of students. Educational data mining (EDM) is an upward field of research, and it is very helpful for academic institutions to predict the academic performance of the students. Educational datasets are the basis of various predictive models. Quality of these models can be improved by using feature selection (FS). To get the required benefits from the available data, there must be some tools for analysis and prediction. In lieu of the above, machine learning/data mining are most suitable. In educational data mining, for better accuracy of prediction models’ and quality of various educational datasets, feature selection (FS) plays a vital role. Feature selection (FS) algorithms abolish inappropriate information from the repositories of educational background so that performance of classifier in terms of accuracy could be increased and the same could be used for better decision. In lieu of the above, a best feature selection algorithm must be selected. In this paper, two filter selection approaches namely correlation feature selection (CFS) and wrapper-based feature selection have been used to demonstrate the importance of selection of a feature subset for a classification problem. The present paper aims to find the detailed investigation of filter feature selection algorithms along with the classification algorithms on a given dataset. We found result with numerous numbers of features from various Feature selection algorithms and classifiers which will help the researcher to discover the most excellent mixture of filter feature selection algorithms and its associated classifiers. The result indicates that SMO and J48 have the highest accuracy measures with the correlation feature selection algorithms, while Naïve Bayes has the highest accuracy measures with the wrapper subset feature selection algorithms for predicting high, medium and low grade for the students.

An effective feature selection scheme is proposed, which utilizes the combination of wrapper and filter: ant colony optimization (ACO) and mutual information (MI). By examining the modeling based on SVMs at the Australian Bureau of Meteorology, the simulation of three different methods of feature selection shows that the proposed method can reduce the dimensionality of inputs, speed up the training of the network and get better performance.KeywordsSupport Vector MachineFeature SelectionMutual InformationCandidate InputPheromone IntensityThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Mutual Information (MI) is a good selector of relevance between input and output feature and have been used as a measure for ranking features in several feature selection methods. Theses methods cannot estimate optimal feature subsets by themselves, but depend on user defined performance. In this paper, we propose estimation of optimal feature subsets by using rough sets to determine candidate feature subset which receives from MI feature selector. The experiment shows that we can correct nonlinear problems and problems in situation of two or more combined features are dominant features, maintain an improve classification accuracy.KeywordsMutual InformationRough setsNonlinear ProblemsMLPC4.5

This paper introduces a pioneering Hybrid Parallel Multi-linear Face Recognition algorithm that capitalizes on multi-linear methodologies, such as Multi-linear Principal Component Analysis (MPCA), Linear Discriminant Analysis (LDA), and Histogram of Oriented Gradients (HOG), to attain exceptional recognition performance. The Hybrid Feature Selection (HFS) algorithm is meticulously crafted to augment the classification performance on the CK+ and FERET datasets by amalgamating the strengths of feature extraction techniques and feature selection methods. HFS seamlessly incorporates Principal Component Analysis (PCA), Local Discriminant Analysis (LDA), and HOG. The primary aim of this algorithm is to autonomously identify a subset of the most distinctive features from the extracted feature pool, thus elevating classification accuracy, precision, recall, and F1-Score. By amalgamating these methodologies, the algorithm adeptly diminishes dimensionality while conserving pivotal features. Experimental trials on facial image datasets, CK+ and FERET, underscore the algorithm's supremacy in terms of accuracy and computational efficiency when contrasted with conventional linear techniques and even certain deep learning approaches. The proposed algorithm proffers an encouraging solution for real-world face recognition applications where precision and operational efficiency are of paramount significance.

It has been demonstrated in previous studies that prolonged mental effort exertion evokes mental fatigue and leads to impairments in task performance. In the current investigation, we aimed to test the hypothesis that mental fatigue depends on motivational processes and can be influenced by task valuation. In two studies, we experimentally manipulated the value of the task by financial rewards (Study 1) and the sense of autonomy (Study 2). Contrary to our predictions, those manipulations did not influence the main dependent variables. We also introduced additional rewards after prolonged effort exertion. In line with our expectations, the results showed that mental fatigue increases with time spent on effortful tasks. Importantly, however, mental fatigue decreases when the value of the task rises. This effect is accompanied by stronger effort engagement and improvement in task performance. The findings support the motivational theories of mental effort and fatigue, showing that mental fatigue might serve as a signal of diminishing value of the ongoing task.