Enhanced Feature Engineering Symmetry Model Based on Novel Dolphin Swarm Algorithm

Microarray databases are the most frequently used datasets for cancer analytics. Microarray databases are characterized by the presence of a very large number of genes, which exceeds the very little number of samples. So, the feature set accumulates the curse of dimensionality. Therefore, selecting a small subset of genes among thousands of genes in microarray data can potentially increase the accuracy for the classification of cancer. Many approaches, from the field of classical machine learning and soft computing, have been used to address the issue of feature selection and feature extraction for better classifications and clustering accuracy. The research outlined in this paper strives to look at a two-stage approach using minimum Redundancy Maximum Relevancy (mRMR), a feature ranking framework as the first stage followed by a hybrid genetic algorithm in the second stage that works on the features ranked by the mRMR. The proposed method is aimed to select the optimal feature subsets for better classification results in binary and multi class datasets to compensate for the curse of dimensionality in microarray datasets. The classifiers used to test the two-stage proposition are SVM, Naive-Bayes, Linear Discriminant Analysis, decision trees and random forest classifiers. The experimental results show that the gene subset selected by the mRMR-GA pipeline gives good results.

We propose a approach to determine features directly based on classification target of proteomic profile, which combines minimum redundancy maximum relevance (MRMR) and support vector machines (SVM). Firstly, the profile are preprocessed through iterative minimum in adaptive setting window (IMASW) and searching window methods for correcting negative intensities caused by manual preprocessing and peak picking. Then, MRMR and support vector machines (SVM) techniques were used to identify biomarkers and build discrimination model. With an optimization of the parameters involved in the modeling, a satisfactory model was achieved for ovarian cancer diagnosis based on proteomic peptide profile dataset. To study the performance of MRMR, we applied two statistical method, t test and Wilcoxon signed-rank test, to identify features. The results show that MRMR method is more efficient.

With the rapid development of the Internet of Things (IoT), the curse of dimensionality becomes increasingly common. Feature selection (FS) is to eliminate irrelevant and redundant features in the datasets. Particle swarm optimization (PSO) is an efficient metaheuristic algorithm that has been successfully applied to obtain the optimal feature subset with essential information in an acceptable time. However, it is easy to fall into the local optima when dealing with high-dimensional datasets due to constant parameter values and insufficient population diversity. In the paper, an FS method is proposed by utilizing adaptive PSO with leadership learning (APSOLL). An adaptive updating strategy for parameters is used to replace the constant parameters, and the leadership learning strategy is utilized to provide valid population diversity. Experimental results on 10 UCI datasets show that APSOLL has better exploration and exploitation capabilities through comparison with PSO, grey wolf optimizer (GWO), Harris hawks optimization (HHO), flower pollination algorithm (FPA), salp swarm algorithm (SSA), linear PSO (LPSO), and hybrid PSO and differential evolution (HPSO-DE). Moreover, less than 8% of features in the original datasets are selected on average, and the feature subsets are more effective in most cases compared to those generated by 6 traditional FS methods (analysis of variance (ANOVA), Chi-Squared (CHI2), Pearson, Spearman, Kendall, and Mutual Information (MI)).

With the intent of assisting gastroenterologists from all over the world, the proposed work aims to eliminate the effort required to achieve accurate diagnoses. Statistically, gastrointestinal diseases often result in fatal disorders, contributing to a significant number of fatalities. The upper gastrointestinal tract (GIT) includes the stomach, esophagus, and duodenum, while the lower one comprises a section of the small intestine, namely the ileum, as well as the large intestine, including the colon. The challenges associated with GIT tract issues are apparently complex. Therefore, multiple challenges exist regarding CAD (Computer-aided diagnosis) and endoscopy, including a lack of annotated images, a dark background, poor contrast, and an irregular pattern. The objective of this research is to develop a robust deep network, called SNet, that offers a solution to complex classification problems. Firstly, the endoscopic images undergo preprocessing before being subjected to feature extraction. This step involves image resizing along with the augmentation step. The proposed convolutional neural network (CNN) model is comprised of six blocks placed at different layers. To enable the exhaustive evaluation of proposed framework across different datasets, the model has undergone training on a very complex HyperKvasir dataset, and later tested on Kvasir v1 and v2 datasets. This facilitates cross-dataset system evaluation, resulting in an efficient system for an unseen image diagnosis. To avoid the problem of "curse of dimensionality", the most discriminant feature information is selected based on proposed minimum redundancy maximum relevance (MRMR) algorithm. The proposed architecture has been evaluated using a range of performance metrics, such as accuracy, sensitivity, specificity, and Area under curve (AUC). With classification accuracy as the main metric, the achieved accuracy is 98.45% on the Kvasir v1, and 97.83% on the Kvasir v2 datasets.

Hundreds of contiguous bands of remotely sensed hyperspectral image (HSI) capture the spectral signatures of observed objects or materials on the earth's surface. Although the HSI data is able to provide huge information with great details, it poses challenges to image analysis because of the high computational cost due to the large dimensionality of the feature space, redundancy in information, and curse of dimensionality. To overcome these difficulties, this paper proposes an information-theoretic feature selection approach for selecting an informative feature subset considering the maximum of the minimum approach. The minimum of conditional mutual information based estimation is used to select a feature among the selected feature subset. This selected feature with the corresponding candidate feature is then exploited using the mutual information and joint mutual information based valuation to find the maximum relevance of the candidate features with the target classes. The effectiveness of the proposed approach, called joint-conditional mutual information for selecting informative feature (JCIF), is assessed by implementing it in some synthetic data and three remotely sensed HSI data. Several known feature selection algorithms are also used for comparison purposes. The results of the experiments with K-Nearest Neighbors and Support Vector Machine classifiers reveal that JCIF performs better in selecting informative features.

Comparative study of feature selection methods for wind speed estimation at ungauged locations

Hyperspectral images (HSIs) generally contain a large amount of spectral bands (features), and the redundant information in them will cause the Hughes phenomenon in the classification process. And feature extraction and feature selection are the two main existing methods to effectively reduce the redundancy of spectral information in the field of HSIs classification. Compared with feature extraction methods, feature selection methods can preserve most of the features of the original HSIs data without losing their valuable details. However, most existing feature selection methods based on single scene (domain) perform poorly in some scenes (domains) with insufficient labeled samples. Therefore, how to adopt an efficient feature selection method to select the optimal feature subsets of source scene and target scene and use the sample information of source scene to assist in the classification of target scene so as to improve the classification accuracy of images in the target scene as much as possible is still very challenging. In order to solve the above problem, this paper proposes a new cross-scene algorithm: Improved Ant Colony Optimization Algorithm-Based Cross-Scene Feature Selection Algorithm (IMACO-CSFS). In order to obtain more accurate feature subsets of the two scenes, IMACO-CSFS proposes a priority sorting-based ant colony strategy to make the subsequent search process focus on the global optimal solution (optimal feature subset) found in the previous iteration. In addition, in order to further accelerate the convergence speed of the global optimal solution, an ant colony strategy based on elite ants is proposed in IMACO-CSFS to more efficiently obtain the optimal feature subsets of the two scenes for training the classifier. Furthermore, this paper simultaneously considers overall classification accuracies of the optimal feature subsets for both scenes and dynamically adjusts their scale to ensure the consistency of the selected features between the two scenes, attenuating the effect of spectral shift and achieving the higher image classification accuracy in the target scene. Experimental results on three cross-scene HSI data pairs demonstrate that IMACO-CSFS is superior in cross-scene feature selection and cross-scene HSIs classification.

As the volume of data for classification tasks in machine learning grows, feature selection plays an increasingly crucial role in enhancing the efficiency and effectiveness of these tasks. Existing classical feature selection algorithms often encounter challenges, such as high computational complexity and vulnerability to local optima. Quantum algorithms have been proposed to overcome these limitations. Here, our work proposes a new approach that combines the Quantum Approximate Optimization Algorithm (QAOA) with the classical feature selection algorithm Maximum Relevance-Minimum Redundancy (MRMR). First, we transform the feature selection problem into the Quadratic Unconstrained Binary Optimization (QUBO) problem. Then, we map the QUBO formulation to Hamiltonian with the Ising model. Finally, we employ QAOA with a shallow circuit to search this Hamiltonian's ground state, which matches the specific solution for feature selection. We conducted numerical experiments on eight real-world datasets for classification tasks from diverse domains, including finance, medicine, and natural hazards. Experiment results suggest that QAOA-selected feature subsets size are typically less than half the complete set while achieving comparable or better classification accuracy than classical MRMR, demonstrating its preference for smaller, more efficient feature subsets.

Whale optimized mixed kernel function of support vector machine for colorectal cancer diagnosis

Various supervised embedded methods have been proposed to select discriminative features from original ones, such as Feature Selection with Orthogonal Regression (FSOR) and Robust Feature Selection. Compared with embedded methods based on the least square regression, FSOR, utilizing orthogonal regression, can preserve more discriminative information in the subspace and have better performance on feature selection. However, the embedded approaches have scarcely considered the dependency among the selected feature subset. To address the defect, in this paper, we propose a two-stage (filter-embedded) feature selection technique based on Maximum Relevance Minimum Redundancy and FSOR, termed as Orthogonal Regression with Minimum Redundancy (ORMR). We compared the feature selection performance between ORMR and nine other state-of-the-art supervised feature selection methods on six benchmark datasets. The results demonstrate the advantage of ORMR method over others in choosing discriminative features with considering the redundant information among the selected feature subset.

ECAmyloid: An amyloid predictor based on ensemble learning and comprehensive sequence-derived features

Feature selection is an important preprocessing in data mining, it aims to reduce the computational complexity of learning algorithm, and to improve the performance of data mining algorithms by removing irrelevant and redundant features. In the framework of discrete-valued feature selection, this paper experimentally compares two feature selection methods which are based on generic algorithm. The former uses relative classification information entropy to measure the significance of the candidate feature subsets, while the later uses inconsistency ratio to evaluate feature subsets. Both methods use genetic algorithm to search the optimal feature subset, we find by experimental comparisons that the former outperforms the latter.

Feature selection aims to gain relevant features for improved classification performance and remove redundant features for reduced computational cost. How to balance these two factors is a problem especially when the categorical labels are costly to obtain. In this paper, we address this problem using semisupervised learning method and propose a max-relevance and min-redundancy criterion based on Pearson's correlation (RRPC) coefficient. This new method uses the incremental search technique to select optimal feature subsets. The new selected features have strong relevance to the labels in supervised manner, and avoid redundancy to the selected feature subsets under unsupervised constraints. Comparative studies are performed on binary data and multicategory data from benchmark data sets. The results show that the RRPC can achieve a good balance between relevance and redundancy in semisupervised feature selection. We also compare the RRPC with classic supervised feature selection criteria (such as mRMR and Fisher score), unsupervised feature selection criteria (such as Laplacian score), and semisupervised feature selection criteria (such as sSelect and locality sensitive). Experimental results demonstrate the effectiveness of our method.

Feature selection based on label distribution and fuzzy mutual information

BackgroundPatients with type 2 diabetes mellitus (T2DM) exhibit a heightened susceptibility to developing dementia, especially those who already present with mild cognitive impairment (MCI). Nevertheless, the fundamental etiology remains elusive, underscoring the pressing need for an objective and precise diagnostic approach in clinical settings. This study investigates the utilization of machine learning algorithms in conjunction with high-resolution sagittal T1-weighted structural imaging to facilitate automated diagnosis of T2DM patients with MCI, differentiating them from both T2DM patients without MCI and healthy controls (HCs).MethodsThirty patients with T2DM and MCI, thirty T2DM patients without MCI, and thirty matched healthy controls (HCs) were enrolled to identify independent biomarkers and develop a diagnostic model for early cognitive impairment in T2DM. Whole-brain structural features-including cortical surface area, volume, thickness, curvature index, folding index, Gaussian curvature, mean curvature, thickness standard deviation, nuclear volume, hippocampal volume, and white matter volume-were extracted from the images of brains using automated segmentation methods. The minimum redundancy maximum relevance (MRMR) method was employed to filter out irrelevant and redundant features, reducing the dimensionality of the dataset. Subsequently, the least absolute shrinkage and selection operator (LASSO) algorithm was applied for further feature selection, ensuring the retention of only the most diagnostic features. The Random Forest (RF) classifier, a powerful machine learning model within the realm of artificial intelligence, was meticulously trained utilizing a curated feature set that had undergone rigorous refinement. To ensure the robust diagnostic performance and generalizability of the established random forest model, a 5-fold cross-validation was employed, providing a dependable estimation of the model’s effectiveness.ResultsThe FreeSurfer software automatically segmented the cerebral imaging data into up to 70 regions. For model establishment, a comprehensive set of 705 structural features, a series of neuropsychological tests, and standard laboratory tests were utilized. Ultimately, 8 features were selected through two feature selection strategies aimed at refining the optimal features. These included bilateral brainstem volume, left hippocampus volume, left transverse temporal gyrus volume, bilateral posterior corpus callosum volume, left medial orbitofrontal cortex Gaussian curvature, glycosylated hemoglobin, blood sugar levels, and the Digit Span Test (DST) backward score. The Random Forest (RF) model, based on the combined features, exhibited the excellent performance, with mean AUCs of 0.959 (95% CI, 0.940–0.997, mean specificity = 94.2%, mean sensitivity = 88.3%, mean accuracy = 88.3% and mean precision = 88.3%) for the training dataset and mean AUCs of 0.887 (95% CI, 0.746–0.992, mean specificity = 85.0%, mean sensitivity = 70.0%, mean accuracy = 70.0% and mean precision = 69.6%) for the testing dataset, based on 5-fold cross-validation.ConclusionThe RF model, leveraging a combination of features, demonstrates high accuracy in diagnosing T2DM with MCI. The exclusion of T2DM patients with complications may limit generalizability to the broader T2DM population, potentially inflating performance estimates. Among these features, 8 optimal indicators comprising 5 structural features, 1 neuropsychological test feature, and 2 standard laboratory test features emerge as the potential independent biomarkers for detecting early-stage cognitive impairment in T2DM patients. These features hold significant importance in understanding the pathophysiological mechanisms of T2DM-related cognitive impairment. Our fully automated model is capable of swiftly processing MRI data, enabling precise and objective differentiation of T2DM with MCI. This model significantly enhances diagnostic efficiency and holds considerable value in clinical practice, facilitating early diagnosis of T2DM with MCI.