GA-SVM based feature selection and parameter optimization in hospitalization expense modeling

Assessing forest fragmentation due to land use changes from 1992 to 2023: A spatio-temporal analysis using remote sensing data

The increasing pressures of urban development and agricultural expansion have significant implications for land use and land cover (LULC) dynamics, particularly in ecologically sensitive regions like the Murree and Kotli Sattian tehsils of the Rawalpindi district in Pakistan. This study's primary objective is to assess spatial variations within each LULC category over three decades (1992-2023) using cross-tabulation in ArcGIS to identify changes in LULC and investigates into forest fragmentation analysis using the Landscape Fragmentation Tool (LFTv2.0) to classify forest into several classes such as patch, edge, perforated, small core, medium core, and large core. Utilizing remote sensing data from Landsat 5 and Landsat 9 satellites, the research focuses on the temporal dynamics in various land classes including Coniferous Forest (CF), Evergreen Forest (EF), Arable Land (AR), Buildup Area (BU), Barren Land (BA), Water (WA), and Grassland (GL). The Support Vector Machine (SVM) classifier and ArcGIS software were employed for image processing and classification, ensuring accuracy in categorizing different land types. Our results indicate a notable reduction in forested areas, with Coniferous Forest (CF) decreasing from 363.9 km2, constituting 45.0 % of the area in 1992, to 291.5 km2 (36.0 %) in 2023, representing a total decrease of 72.4 km2. Similarly, Evergreen Forests have also seen a significant reduction, from 177.9 km2 (22.0 %) in 1992 to 99.8 km2 (12.3 %) in 2023, a decrease of 78.1 km2. The study investigates into forest fragmentation analysis using the Landscape Fragmentation Tool (LFTv2.0), revealing an increase in fragmentation and a decrease in large core forests from 20.3 % of the total area in 1992 to 7.2 % in 2023. Additionally, the patch forest area increased from 2.4 % in 1992 to 5.9 % in 2023, indicating significant fragmentation. Transition matrices and a Sankey diagram illustrate the transitions between different LULC classes, providing a comprehensive view of the dynamics of land-use changes and their implications for ecosystem services. These findings highlight the critical need for robust conservation strategies and effective land management practices. The study contributes to the understanding of LULC dynamics and forest fragmentation in the Himalayan region of Pakistan, offering insights essential for future land management and policymaking in the face of rapid environmental changes.

Hybrid feature selection and classification technique for early prediction and severity of diabetes type 2

Diabetes prediction is an ongoing study topic in which medical specialists are attempting to forecast the condition with greater precision. Diabetes typically stays lethargic, and on the off chance that patients are determined to have another illness, like harm to the kidney vessels, issues with the retina of the eye, or a heart issue, it can cause metabolic problems and various complexities in the body. Various worldwide learning procedures, including casting a ballot, supporting, and sacking, have been applied in this review. The Engineered Minority Oversampling Procedure (Destroyed), along with the K-overlay cross-approval approach, was utilized to achieve class evening out and approve the discoveries. Pima Indian Diabetes (PID) dataset is accumulated from the UCI Machine Learning (UCI ML) store for this review, and this dataset was picked. A highlighted engineering technique was used to calculate the influence of lifestyle factors. A two-phase classification model has been developed to predict insulin resistance using the Sequential Minimal Optimisation (SMO) and SMOTE approaches together. The SMOTE technique is used to preprocess data in the model's first phase, while SMO classes are used in the second phase. All other categorization techniques were outperformed by bagging decision trees in terms of Misclassification Error rate, Accuracy, Specificity, Precision, Recall, F1 measures, and ROC curve. The model was created using a combined SMOTE and SMO strategy, which achieved 99.07% correction with 0.1 ms of runtime. The suggested system's result is to enhance the classifier's performance in spotting illness early.

A feature selection method based on the Golden Jackal-Grey Wolf Hybrid Optimization Algorithm

This paper proposes a feature selection method based on a hybrid optimization algorithm that combines the Golden Jackal Optimization (GJO) and Grey Wolf Optimizer (GWO). The primary objective of this method is to create an effective data dimensionality reduction technique for eliminating redundant, irrelevant, and noisy features within high-dimensional datasets. Drawing inspiration from the Chinese idiom "Chai Lang Hu Bao," hybrid algorithm mechanisms, and cooperative behaviors observed in natural animal populations, we amalgamate the GWO algorithm, the Lagrange interpolation method, and the GJO algorithm to propose the multi-strategy fusion GJO-GWO algorithm. In Case 1, the GJO-GWO algorithm addressed eight complex benchmark functions. In Case 2, GJO-GWO was utilized to tackle ten feature selection problems. Experimental results consistently demonstrate that under identical experimental conditions, whether solving complex benchmark functions or addressing feature selection problems, GJO-GWO exhibits smaller means, lower standard deviations, higher classification accuracy, and reduced execution times. These findings affirm the superior optimization performance, classification accuracy, and stability of the GJO-GWO algorithm.

MSXFGP: combining improved sparrow search algorithm with XGBoost for enhanced genomic prediction

BACKGROUND

With the significant reduction in the cost of high-throughput sequencing technology, genomic selection technology has been rapidly developed in the field of plant breeding. Although numerous genomic selection methods have been proposed by researchers, the existing genomic selection methods still face the problem of poor prediction accuracy in practical applications.

RESULTS

This paper proposes a genome prediction method MSXFGP based on a multi-strategy improved sparrow search algorithm (SSA) to optimize XGBoost parameters and feature selection. Firstly, logistic chaos mapping, elite learning, adaptive parameter adjustment, Levy flight, and an early stop strategy are incorporated into the SSA. This integration serves to enhance the global and local search capabilities of the algorithm, thereby improving its convergence accuracy and stability. Subsequently, the improved SSA is utilized to concurrently optimize XGBoost parameters and feature selection, leading to the establishment of a new genomic selection method, MSXFGP. Utilizing both the coefficient of determination R2 and the Pearson correlation coefficient as evaluation metrics, MSXFGP was evaluated against six existing genomic selection models across six datasets. The findings reveal that MSXFGP prediction accuracy is comparable or better than existing widely used genomic selection methods, and it exhibits better accuracy when R2 is utilized as an assessment metric. Additionally, this research provides a user-friendly Python utility designed to aid breeders in the effective application of this innovative method. MSXFGP is accessible at https://github.com/DIBreeding/MSXFGP .

CONCLUSIONS

The experimental results show that the prediction accuracy of MSXFGP is comparable or better than existing genome selection methods, providing a new approach for plant genome selection.

IBGJO: Improved Binary Golden Jackal Optimization with Chaotic Tent Map and Cosine Similarity for Feature Selection

Feature selection is a crucial process in machine learning and data mining that identifies the most pertinent and valuable features in a dataset. It enhances the efficacy and precision of predictive models by efficiently reducing the number of features. This reduction improves classification accuracy, lessens the computational burden, and enhances overall performance. This study proposes the improved binary golden jackal optimization (IBGJO) algorithm, an extension of the conventional golden jackal optimization (GJO) algorithm. IBGJO serves as a search strategy for wrapper-based feature selection. It comprises three key factors: a population initialization process with a chaotic tent map (CTM) mechanism that enhances exploitation abilities and guarantees population diversity, an adaptive position update mechanism using cosine similarity to prevent premature convergence, and a binary mechanism well-suited for binary feature selection problems. We evaluated IBGJO on 28 classical datasets from the UC Irvine Machine Learning Repository. The results show that the CTM mechanism and the position update strategy based on cosine similarity proposed in IBGJO can significantly improve the Rate of convergence of the conventional GJO algorithm, and the accuracy is also significantly better than other algorithms. Additionally, we evaluate the effectiveness and performance of the enhanced factors. Our empirical results show that the proposed CTM mechanism and the position update strategy based on cosine similarity can help the conventional GJO algorithm converge faster.

Nested multi-scale transform fusion model: The response evaluation of chemoradiotherapy for patients with lung tumors

BACKGROUND AND OBJECTIVE

The response evaluation of chemoradiotherapy is an important method of precision treatment for patients with malignant lung tumors. In view of the existing evaluation criteria for chemoradiotherapy, it is difficult to synthesize the geometric and shape characteristics of lung tumors. In the present, the response evaluation of chemoradiotherapy is limited. Therefore, this paper constructs a response evaluation system of chemoradiotherapy based on PET/CT images.

METHODS

There are two parts in the system: a nested multi-scale fusion model and an attribute sets for the Response evaluation of chemoradiotherapy (AS-REC). In the first part, a new nested multi-scale transform method, i.e., latent low-rank representation (LATLRR) and non-subsampled contourlet transform (NSCT), is proposed. Then, the average gradient self-adaptive weighting is used for the low-frequency fusion rule, and the regional energy fusion rule is used for the high-frequency fusion rule. Further, the low-rank part fusion image is obtained by the inverse NSCT, and the fusion image is generated by adding the low-rank part fusion image and the significant part fusion image. In the second part, AS-REC is constructed to evaluate the growth direction of the tumor, the degree of tumor metabolic activity, and the tumor growth state.

RESULTS

the numerical results clearly show that the performance of our proposed method outperforms in comparison with several existing methods, among them, the value of Qabf increased by up to 69%.

CONCLUSIONS

Through the experiment of three reexamination patients, the effectiveness of the evaluation system of radiotherapy and chemotherapy are proved.

SVM classifier of cervical histopathology images based on texture and morphological features

BACKGROUND

Cervical histopathology image classification is a crucial indicator in cervical biopsy results.

OBJECTIVE

The objective of this study is to identify histopathology images of cervical cancer at an early stage by extracting texture and morphological features for the Support Vector Machine (SVM) classifier.

METHODS

We extract three different texture features and one morphological feature of cervical histopathology images: first-order histogram, K-means clustering, Gray Level Co-occurrence Matrix (GLCM) and nucleus feature. The original dataset used in our experiment is obtained from 20 patients diagnosed with cervical cancer, including 135 whole slide images (WSIs). Given an entire WSI, the patches on its tissue region are extracted randomly.

RESULTS

We finally obtain 3,000 patches, including 1,000 normal, 1,000 hysteromyoma and 1,000 cancer images. Among them, 80% of the entire data set is randomly selected as training set and the remaining 20% as test set. The accuracy of SVM classification using first-order histogram, K-means clustering, GLAM and nucleus feature for extracting features are respectively 87.4%, 90.6%, 91.6% and 93.5%.

CONCLUSIONS

The classification accuracy of the SVM combining the four features is 96.8%, and the proposed nucleus feature plays a key role in the SVM classification of cervical histopathology images.

A New Mixed-Gas-Detection Method Based on a Support Vector Machine Optimized by a Sparrow Search Algorithm

To solve the problem of the low recognition rate of mixed gases and consider the phenomenon of low prediction accuracy when traditional gas-concentration-prediction methods deal with nonlinear data, this paper proposes a mixed-gas identification and gas-concentration-prediction method based on a support vector machine (SVM) optimized by a sparrow search algorithm (SSA). Principal component analysis (PCA) is applied to perform data dimensionality reduction on the input data, and SSA is adopted to optimize the SVM hyperparameters to improve the recognition rate and gas-concentration-prediction accuracy of mixed gases. For the mixed-gas identification, the classification accuracy is significantly improved under the proposed SSA optimization SVM method (SSA-SVM), compared with random forest (RF), extreme-learning machine (ELM), and BP neural network methods. With respect to gas-concentration prediction, the maximum fitting degrees reached 99.34% for single gas-concentration prediction and 97.55% for mixed-gas-concentration prediction. The experimental results show that the SSA-SVM method had a high recognition rate and high concentration-prediction accuracy in gas-mixture detection.

A Steering-Matrix-Based Multiobjective Evolutionary Algorithm for High-Dimensional Feature Selection

In recent years, multiobjective evolutionary algorithms (MOEAs) have been demonstrated to show promising performance in feature selection (FS) tasks. However, designing an MOEA for high-dimensional FS is more challenging due to the curse of dimensionality. To address this problem, in this article, a steering-matrix-based multiobjective evolutionary algorithm, called SM-MOEA, is proposed. In SM-MOEA, a steering matrix is suggested and harnessed to guide the evolution of the population, which not only improves the search efficiency greatly but also obtains the feature subsets with high quality. Specifically, each element SM (i, j) in the steering matrix SM reflects the probability of the j th feature that is selected in the i th individual (feature subset), which is generated by considering the importance of both the feature j and the individual i . Based on the suggested steering matrix, two important operators referred to as dimensionality reduction and individual repairing operators are developed to effectively steer the population evolution in each generation. In addition, an effective initialization and update strategy for the steering matrix is also designed to further improve the performance of SM-MOEA. The experimental results on 12 high-dimensional datasets with the number of features ranging from 3000 to 13 000 demonstrate the superiority of the proposed algorithm over several state-of-the-art algorithms (including single-objective and MOEAs for high-dimensional FS) in terms of both the number and quality of the selected features.

Multiclass feature selection with metaheuristic optimization algorithms: a review

Selecting relevant feature subsets is vital in machine learning, and multiclass feature selection is harder to perform since most classifications are binary. The feature selection problem aims at reducing the feature set dimension while maintaining the performance model accuracy. Datasets can be classified using various methods. Nevertheless, metaheuristic algorithms attract substantial attention to solving different problems in optimization. For this reason, this paper presents a systematic survey of literature for solving multiclass feature selection problems utilizing metaheuristic algorithms that can assist classifiers selects optima or near optima features faster and more accurately. Metaheuristic algorithms have also been presented in four primary behavior-based categories, i.e., evolutionary-based, swarm-intelligence-based, physics-based, and human-based, even though some literature works presented more categorization. Further, lists of metaheuristic algorithms were introduced in the categories mentioned. In finding the solution to issues related to multiclass feature selection, only articles on metaheuristic algorithms used for multiclass feature selection problems from the year 2000 to 2022 were reviewed about their different categories and detailed descriptions. We considered some application areas for some of the metaheuristic algorithms applied for multiclass feature selection with their variations. Popular multiclass classifiers for feature selection were also examined. Moreover, we also presented the challenges of metaheuristic algorithms for feature selection, and we identified gaps for further research studies.

Application of random forest based on semi-automatic parameter adjustment for optimization of anti-breast cancer drugs

The optimization of drug properties in the process of cancer drug development is very important to save research and development time and cost. In order to make the anti-breast cancer drug candidates with good biological activity, this paper collected 1974 compounds, firstly, the top 20 molecular descriptors that have the most influence on biological activity were screened by using XGBoost-based data feature selection; secondly, on this basis, take pIC50 values as feature data and use a variety of machine learning algorithms to compare, soas to select a most suitable algorithm to predict the IC50 and pIC50 values. It is preliminarily found that the effects of Random Forest, XGBoost and Gradient-enhanced algorithms are good and have little difference, and the Support vector machine is the worst. Then, using the Semi-automatic parameter adjustment method to adjust the parameters of Random Forest, XGBoost and Gradient-enhanced algorithms to find the optimal parameters. It is found that the Random Forest algorithm has high accuracy and excellent anti over fitting, and the algorithm is stable. Its prediction accuracy is 0.745. Finally, the accuracy of the results is verified by training the model with the preliminarily selected data, which provides an innovative solution for the optimization of the properties of anti- breast cancer drugs, and can provide better support for the early research and development of anti-breast cancer drugs.

A two-stage stacked-based heterogeneous ensemble learning for cancer survival prediction

Cancer survival prediction is one of the three major tasks of cancer prognosis. To improve the accuracy of cancer survival prediction, in this paper, we propose a priori knowledge- and stability-based feature selection (PKSFS) method and develop a novel two-stage heterogeneous stacked ensemble learning model (BQAXR) to predict the survival status of cancer patients. Specifically, PKSFS first obtains the optimal feature subsets from the high-dimensional cancer datasets to guide the subsequent model construction. Then, BQAXR seeks to generate five high-quality heterogeneous learners, among which the shortcomings of the learners are overcome by using improved methods, and integrate them in two stages through the stacked generalization strategy based on optimal feature subsets. To verify the merits of PKSFS and BQAXR, this paper collected the real survival datasets of gastric cancer and skin cancer from the Surveillance, Epidemiology, and End Results (SEER) database of the National Cancer Institute, and conducted extensive numerical experiments from different perspectives based on these two datasets. The accuracy and AUC of the proposed method are 0.8209 and 0.8203 in the gastric cancer dataset, and 0.8336 and 0.8214 in the skin cancer dataset. The results show that PKSFS has marked advantages over popular feature selection methods in processing high-dimensional datasets. By taking full advantage of heterogeneous high-quality learners, BQAXR is not only superior to mainstream machine learning methods, but also outperforms improved machine learning methods, which indicates can effectively improve the accuracy of cancer survival prediction and provide a reference for doctors to make medical decisions.

A Comparative Analysis of Swarm Intelligence and Evolutionary Algorithms for Feature Selection in SVM-Based Hyperspectral Image Classification

Feature selection (FS) is vital in hyperspectral image (HSI) classification, it is an NP-hard problem, and Swarm Intelligence and Evolutionary Algorithms (SIEAs) have been proved effective in solving it. However, the high dimensionality of HSIs still leads to the inefficient operation of SIEAs. In addition, many SIEAs exist, but few studies have conducted a comparative analysis of them for HSI FS. Thus, our study has two goals: (1) to propose a new filter–wrapper (F–W) framework that can improve the SIEAs’ performance; and (2) to apply ten SIEAs under the F–W framework (F–W–SIEAs) to optimize the support vector machine (SVM) and compare their performance concerning five aspects, namely the accuracy, the number of selected bands, the convergence rate, and the relative runtime. Based on three HSIs (i.e., Indian Pines, Salinas, and Kennedy Space Center (KSC)), we demonstrate how the proposed framework helps improve these SIEAs’ performances. The five aspects of the ten algorithms are different, but some have similar optimization capacities. On average, the F–W–Genetic Algorithm (F–W–GA) and F–W–Grey Wolf Optimizer (F–W–GWO) have the strongest optimization abilities, while the F–W–GWO requires the least runtime among the ten. The F–W–Marine Predators Algorithm (F–W–MPA) is second only to the two and slightly better than F–W–Differential Evolution (F–W–DE). The F–W–Ant Lion Optimizer (F–W–ALO), F–W–I-Ching Divination Evolutionary Algorithm (F–W–IDEA), and F–W–Whale Optimization Algorithm (F–W–WOA) have the middle optimization abilities, and F–W–IDEA takes the most runtime. Moreover, the F–W–SIEAs outperform other commonly used FS techniques in accuracy overall, especially in complex scenes.

Discrimination of Methicillin-resistant Staphylococcus aureus by MALDI-TOF Mass Spectrometry with Machine Learning Techniques in Patients with Staphylococcus aureus Bacteremia

Early administration of proper antibiotics is considered to improve the clinical outcomes of Staphylococcus aureus bacteremia (SAB), but routine clinical antimicrobial susceptibility testing takes an additional 24 h after species identification. Recent studies elucidated matrix-assisted laser desorption/ionization time-of-flight mass spectra to discriminate methicillin-resistant strains (MRSA) or even incorporated with machine learning (ML) techniques. However, no universally applicable mass peaks were revealed, which means that the discrimination model might need to be established or calibrated by local strains’ data. Here, a clinically feasible workflow was provided. We collected mass spectra from SAB patients over an 8-month duration and preprocessed by binning with reference peaks. Machine learning models were trained and tested by samples independently of the first six months and the following two months, respectively. The ML models were optimized by genetic algorithm (GA). The accuracy, sensitivity, specificity, and AUC of the independent testing of the best model, i.e., SVM, under the optimal parameters were 87%, 75%, 95%, and 87%, respectively. In summary, almost all resistant results were truly resistant, implying that physicians might escalate antibiotics for MRSA 24 h earlier. This report presents an attainable method for clinical laboratories to build an MRSA model and boost the performance using their local data.

APU-Net: An Attention Mechanism Parallel U-Net for Lung Tumor Segmentation

Lung cancer is one of the malignant tumors with high morbidity and mortality, and lung nodules are the early stages of lung cancer. The symptoms of pulmonary nodules are not obvious in the clinic, and the optimal treatment time is missed due to the missed diagnosis in the clinic. A parallel U-Net network called APU-Net is proposed. Firstly, two parallel U-Net networks are used to extract the features of different modalities. Among them, the subnetwork UNet_B extracts the CT image features, and the subnetwork UNet_A consists of two encoders to extract the PET/CT and PET image features. Secondly, multimodal feature extraction blocks are used to extract features for PET/CT and PET images in UNet_B network. Thirdly, a hybrid attention mechanism is added to the encoding paths of the UNet_A and UNet_B. Finally, a multiscale feature aggregation block is used for extracting feature maps of different scales of decoding path. On the lung tumor 18FDGPET/CT multimodal medical images dataset, experiments' results show that the DSC, Recall, VOE, and RVD coefficients of APU-Net are 96.86%, 97.53%, 3.18%, and 3.29%, respectively. APU-Net can improve the segmentation accuracy of the adhesion between the lesion of complex shape and the normal tissue. This has positive significance for computer-aided diagnosis.

A bio-mathematical approach to control the Anopheles mosquito using sterile males technology

Initiative for this study is taken to solve the mathematical model which is base-forming with population dynamics of the Anopheles mosquito using an advanced computational intelligence scheme named as genetic algorithm (GA), artificial neural network (ANN). This ANN is a famous global search method, active set (AS) scheme known as a quick local refinement, i.e. ANN-GA-AS. An error-based fitness function is optimized which is made by using the sense of the differential system and boundary conditions for solving the Anopheles mosquito control model. The ability of the stochastic ANN-GA-AS approach to solve the population dynamics of the Anopheles mosquito is examined to check the exactness, efficiency, precision, and consistency of the scheme. The numerical outcomes of the Anopheles mosquito control model through the ANN-GA-AS approach are compared with the reference Adams numerical results to show the significance of the designed scheme. Moreover, statistical considerations using the “semi-interquartile range”, “Theil’s inequality coefficient”, and “mean absolute deviation” have been applied to validate the precision and accuracy of the obtained results.

Dense Convolutional Network and Its Application in Medical Image Analysis

Dense convolutional network (DenseNet) is a hot topic in deep learning research in recent years, which has good applications in medical image analysis. In this paper, DenseNet is summarized from the following aspects. First, the basic principle of DenseNet is introduced; second, the development of DenseNet is summarized and analyzed from five aspects: broaden DenseNet structure, lightweight DenseNet structure, dense unit, dense connection mode, and attention mechanism; finally, the application research of DenseNet in the field of medical image analysis is summarized from three aspects: pattern recognition, image segmentation, and object detection. The network structures of DenseNet are systematically summarized in this paper, which has certain positive significance for the research and development of DenseNet.

Predicting streamflow in Peninsular Malaysia using support vector machine and deep learning algorithms

Floods and droughts are environmental phenomena that occur in Peninsular Malaysia due to extreme values of streamflow (SF). Due to this, the study of SF prediction is highly significant for the purpose of municipal and environmental damage mitigation. In the present study, machine learning (ML) models based on the support vector machine (SVM), artificial neural network (ANN), and long short-term memory (LSTM), are tested and developed to predict SF for 11 different rivers throughout Peninsular Malaysia. SF data sets for the rivers were collected from the Malaysian Department of Irrigation and Drainage. The main objective of the present study is to propose a universal model that is most capable of predicting SFs for rivers within Peninsular Malaysia. Based on the findings, the ANN3 model which was developed using the ANN algorithm and input scenario 3 (inputs consisting of previous 3 days SF) is deduced as the best overall ML model for SF prediction as it outperformed all the other models in 4 out of 11 of the tested data sets; and obtained among the highest average RMs with a score of 3.27, hence indicating that the model is very adaptable and reliable in accurately predicting SF based on different data sets and river case studies. Therefore, the ANN3 model is proposed as a universal model for SF prediction within Peninsular Malaysia.

Novel Improved Salp Swarm Algorithm: An Application for Feature Selection

We live in a period when smart devices gather a large amount of data from a variety of sensors and it is often the case that decisions are taken based on them in a more or less autonomous manner. Still, many of the inputs do not prove to be essential in the decision-making process; hence, it is of utmost importance to find the means of eliminating the noise and concentrating on the most influential attributes. In this sense, we put forward a method based on the swarm intelligence paradigm for extracting the most important features from several datasets. The thematic of this paper is a novel implementation of an algorithm from the swarm intelligence branch of the machine learning domain for improving feature selection. The combination of machine learning with the metaheuristic approaches has recently created a new branch of artificial intelligence called learnheuristics. This approach benefits both from the capability of feature selection to find the solutions that most impact on accuracy and performance, as well as the well known characteristic of swarm intelligence algorithms to efficiently comb through a large search space of solutions. The latter is used as a wrapper method in feature selection and the improvements are significant. In this paper, a modified version of the salp swarm algorithm for feature selection is proposed. This solution is verified by 21 datasets with the classification model of K-nearest neighborhoods. Furthermore, the performance of the algorithm is compared to the best algorithms with the same test setup resulting in better number of features and classification accuracy for the proposed solution. Therefore, the proposed method tackles feature selection and demonstrates its success with many benchmark datasets.

An Advance Computing Numerical Heuristic of Nonlinear SIR Dengue Fever System Using the Morlet Wavelet Kernel

This study is associated to solve the nonlinear SIR dengue fever system using a computational methodology by operating the neural networks based on the designed Morlet wavelet (MWNNs), global scheme as genetic algorithm (GA), and rapid local search scheme as interior-point algorithm (IPA), i.e., GA-IPA. The optimization of fitness function based on MWNNs is performed for solving the nonlinear SIR dengue fever system. This MWNNs-based fitness function is accessible using the differential system and initial conditions of the nonlinear SIR dengue fever system. The designed procedures based on the MWNN-GA-IPA are applied to solve the nonlinear SIR dengue fever system to check the exactness, precision, constancy, and efficiency. The achieved numerical form of the nonlinear SIR dengue fever system via MWNN-GA-IPA was compared with the Runge–Kutta numerical results that verify the significance of MWNN-GA-IPA. Moreover, statistical reflections through different measures for the nonlinear SIR dengue fever system endorse the precision and convergence of the computational MWNN-GA-IPA.

Gudermannian neural networks using the optimization procedures of genetic algorithm and active set approach for the three-species food chain nonlinear model

The present study is to investigate the Gudermannian neural networks (GNNs) using the optimization procedures of genetic algorithm and active-set approach (GA-ASA) to solve the three-species food chain nonlinear model. The three-species food chain nonlinear model is dependent upon the prey populations, top-predator, and specialist predator. The design of an error-based fitness function is presented using the sense of the three-species food chain nonlinear model and its initial conditions. The numerical results of the model have been obtained by exploiting the GNN-GA-ASA. The obtained results through the GNN-GA-ASA have been compared with the Runge-Kutta method to substantiate the correctness of the designed approach. The reliability, efficacy and authenticity of the proposed GNN-GA-ASA are examined through different statistical measures based on single and multiple neurons for solving the three-species food chain nonlinear model.

A noise-immune reinforcement learning method for early diagnosis of neuropsychiatric systemic lupus erythematosus

The neuropsychiatric systemic lupus erythematosus (NPSLE), a severe disease that can damage the heart, liver, kidney, and other vital organs, often involves the central nervous system and even leads to death. Magnetic resonance spectroscopy (MRS) is a brain functional imaging technology that can detect the concentration of metabolites in organs and tissues non-invasively. However, the performance of early diagnosis of NPSLE through conventional MRS analysis is still unsatisfactory. In this paper, we propose a novel method based on genetic algorithm (GA) and multi-agent reinforcement learning (MARL) to improve the performance of the NPSLE diagnosis model. Firstly, the proton magnetic resonance spectroscopy (1H-MRS) data from 23 NPSLE patients and 16 age-matched healthy controls (HC) were standardized before training. Secondly, we adopt MARL by assigning an agent to each feature to select the optimal feature subset. Thirdly, the parameter of SVM is optimized by GA. Our experiment shows that the SVM classifier optimized by feature selection and parameter optimization achieves 94.9% accuracy, 91.3% sensitivity, 100% specificity and 0.87 cross-validation score, which is the best score compared with other state-of-the-art machine learning algorithms. Furthermore, our method is even better than other dimension reduction ones, such as SVM based on principal component analysis (PCA) and variational autoencoder (VAE). By analyzing the metabolites obtained by MRS, we believe that this method can provide a reliable classification result for doctors and can be effectively used for the early diagnosis of this disease.

A Novel Design of Morlet Wavelet to Solve the Dynamics of Nervous Stomach Nonlinear Model

The present study introduces a novel design of Morlet wavelet neural network (MWNN) models to solve a class of a nonlinear nervous stomach system represented with governing ODEs systems via three categories, tension, food and medicine, i.e., TFM model. The comprehensive detail of each category is designated together with the sleep factor, food rate, tension rate, medicine factor and death rate are also provided. The computational structure of MWNNs along with the global search ability of genetic algorithm (GA) and local search competence of active-set algorithms (ASAs), i.e., MWNN-GA-ASAs is applied to solve the TFM model. The optimization of an error function, for nonlinear TFM model and its related boundary conditions, is performed using the hybrid heuristics of GA-ASAs. The performance of the obtained outcomes through MWNN-GA-ASAs for solving the nonlinear TFM model is compared with the results of state of the article numerical computing paradigm via Adams methods to validate the precision of the MWNN-GA-ASAs. Moreover, statistical assessments studies for 50 independent trials with 10 neuron-based networks further authenticate the efficacy, reliability and consistent convergence of the proposed MWNN-GA-ASAs.

Stochastic numerical investigations for nonlinear three-species food chain system

In this work, three-dimensional nonlinear food chain system is numerically treated using the computational heuristic framework of artificial neural networks (ANNs) together with the proficiencies of global and local search approaches based on genetic algorithm (GA) and interior-point algorithm scheme (IPAS), i.e. ANN–GA–IPAS. The three-dimensional food chain system consists of prey populations, specialist predator and top-predator. The formulation of an objective function using the differential system of three-species food chain and its initial conditions is presented and the optimization is performed by using the hybrid computing efficiency of GA–IPAS. The achieved numerical solutions through ANN–GA–IPAS to solve the nonlinear three-species food chain system are compared with the Adams method to validate the exactness of the designed ANN–GA–IPAS. The comparison of the results is presented to authenticate the correctness of the designed ANN–GA–IPAS for solving the nonlinear three-species food chain system. Moreover, statistical representations for 40 independent trials and 30 variables validate the efficacy, constancy and reliability of ANN–GA–IPAS.

Designing of Morlet wavelet as a neural network for a novel prevention category in the HIV system

The aim of this work is to present a design of Morlet wavelet neural network (MWNN) for solving a novel prevention category (P) in the HIV system, known as HIPV mathematical model. The numerical performance of the novel HIPV mathematical model will be observed by exploiting the MWNN that works through the optimization procedures of global/local via “genetic algorithm (GA)” and local search “interior-point algorithm (IPA)”, i.e. MWNN-GA-IPA. An error function using the differential HIPV mathematical model and its initial conditions is presented and optimized by the MWNN-GA-IPA. The obtained results have been compared with the Adams method to check the competence of the MWNN-GA-IPA. For the reliability and stability of the scheme, the performance using different statistical operators has been performed based on the multiple independent trials to solve the novel HIPV mathematical model.

A Cutting Pattern Recognition Method for Shearers Based on ICEEMDAN and Improved Grey Wolf Optimizer Algorithm-Optimized SVM

When the shearer is cutting, the sound signal generated by the cutting drum crushing coal and rock contains a wealth of cutting status information. In order to effectively process the shearer cutting sound signal and accurately identify the cutting mode, this paper proposed a shearer cutting sound signal recognition method based on an improved complete ensemble empirical mode decomposition with adaptive noise (ICCEMDAN) and an improved grey wolf optimizer (IGWO) algorithm-optimized support vector machine (SVM). First, the approach applied ICEEMDAN to process the cutting sound signal and obtained several intrinsic mode function (IMF) components. It used the correlation coefficient to select the characteristic component. Meanwhile, this paper calculated the composite multi-scale permutation entropy (CMPE) of the characteristic components as the eigenvalue. Then, the method introduced a differential evolution algorithm and nonlinear convergence factor to improve the GWO algorithm. It used the improved GWO algorithm to realize the adaptive selection of SVM parameters and established a cutting sound signal recognition model. According to the proportioning plan, the paper made several simulation coal walls for cutting experiments and collected cutting sound signals for cutting pattern recognition. The experimental results show that the method proposed in this paper can effectively process the cutting sound signal of the shearer, and the average accuracy of the cutting pattern recognition model reached 97.67%.

Boundaries tuned support vector machine (BT-SVM) classifier for cancer prediction from gene selection

In recent days, the identified genes which are detecting cancer-causing diseases are plays a crucial part in the microarray data analysis. Huge volume of data required since the disease changed often. Conventional data mining techniques are lacking in space concern and time complexity. Based on big data the proposed work is executed. Using the ISPCA - Improved Supervised Principal Component Analysis, feature extraction is developed in this study. For gene expression, co-variance matrix is generated and through feature selection cancer classification is performed by IPSCA. Further feature selection process by boundaries tuned support vector machines (BT-SVM) classifier and modified particle swarm optimization with novel wrapper model algorithm are performed. The experimentation is carried out by utilizing different datasets like leukaemia, breast cancer dataset, brain cancer, colon, and lung carcinoma from the UCI repository. The proposed work is executed on six benchmark dataset for DNA microarray data in terms of accuracy, recall, and precision to evaluate the performance of the proposed work. For evaluating the proposed work effectiveness, it is compared with various traditional techniques and resulted in optimum accuracy, recall, precision and training time with and without feature selection effectively.

Soft Computing Paradigms to Find the Numerical Solutions of a Nonlinear Influenza Disease Model

The aim of this work is to present the numerical results of the influenza disease nonlinear system using the feed forward artificial neural networks (ANNs) along with the optimization of the combination of global and local search schemes. The genetic algorithm (GA) and active-set method (ASM), i.e., GA-ASM, are implemented as global and local search schemes. The mathematical nonlinear influenza disease system is dependent of four classes, susceptible S(u), infected I(u), recovered R(u) and cross-immune individuals C(u). For the solutions of these classes based on influenza disease system, the design of an objective function is presented using these differential system equations and its corresponding initial conditions. The optimization of this objective function is using the hybrid computing combination of GA-ASM for solving all classes of the influenza disease nonlinear system. The obtained numerical results will be compared by the Adams numerical results to check the authenticity of the designed ANN-GA-ASM. In addition, the designed approach through statistical based operators shows the consistency and stability for solving the influenza disease nonlinear system.

A Hybrid Method to Predict Postoperative Survival of Lung Cancer Using Improved SMOTE and Adaptive SVM

Predicting postoperative survival of lung cancer patients (LCPs) is an important problem of medical decision-making. However, the imbalanced distribution of patient survival in the dataset increases the difficulty of prediction. Although the synthetic minority oversampling technique (SMOTE) can be used to deal with imbalanced data, it cannot identify data noise. On the other hand, many studies use a support vector machine (SVM) combined with resampling technology to deal with imbalanced data. However, most studies require manual setting of SVM parameters, which makes it difficult to obtain the best performance. In this paper, a hybrid improved SMOTE and adaptive SVM method is proposed for imbalance data to predict the postoperative survival of LCPs. The proposed method is divided into two stages: in the first stage, the cross-validated committees filter (CVCF) is used to remove noise samples to improve the performance of SMOTE. In the second stage, we propose an adaptive SVM, which uses fuzzy self-tuning particle swarm optimization (FPSO) to optimize the parameters of SVM. Compared with other advanced algorithms, our proposed method obtains the best performance with 95.11% accuracy, 95.10% G-mean, 95.02% F1, and 95.10% area under the curve (AUC) for predicting postoperative survival of LCPs.

Hybrid Artificial Intelligence HFS-RF-PSO Model for Construction Labor Productivity Prediction and Optimization

This paper presents a novel approach, using hybrid feature selection (HFS), machine learning (ML), and particle swarm optimization (PSO) to predict and optimize construction labor productivity (CLP). HFS selects factors that are most predictive of CLP to reduce the complexity of CLP data. Selected factors are used as inputs for four ML models for CLP prediction. The study results showed that random forest (RF) obtains better performance in mapping the relationship between CLP and selected factors affecting CLP, compared with the other three models. Finally, the integration of RF and PSO is developed to identify the maximum CLP value and the optimum value of each selected factor. This paper introduces a new hybrid model named HFS-RF-PSO that addresses the main limitation of existing CLP prediction studies, which is the lack of capacity to optimize CLP and its most predictive factors with respect to a construction company’s preferences, such as a targeted CLP. The major contribution of this paper is the development of the hybrid HFS-RF-PSO model as a novel approach for optimizing factors that influence CLP and identifying the maximum CLP value.

WR-SVM Model Based on the Margin Radius Approach for Solving the Minimum Enclosing Ball Problem in Support Vector Machine Classification

The generalization error of conventional support vector machine (SVM) depends on the ratio of two factors; radius and margin. The traditional SVM aims to maximize margin but ignore minimization of radius, which decreases the overall performance of the SVM classifier. However, different approaches are developed to achieve a trade-off between the margin and radius. Still, the computational cost of all these approaches is high due to the requirements of matrix transformation. Furthermore, a conventional SVM tries to set the best hyperplane between classes, and due to some robust kernel tricks, an SVM is used in many non-linear and complex problems. The configuration of the best hyperplane between classes is not effective; therefore, it is required to bind a class within its limited area to enhance the performance of the SVM classifier. The area enclosed by a class is called its Minimum Enclosing Ball (MEB), and it is one of the emerging problems of SVM. Therefore, a robust solution is needed to improve the performance of the conventional SVM to overcome the highlighted issues. In this research study, a novel weighted radius SVM (WR-SVM) is proposed to determine the tighter bounds of MEB. The proposed solution uses a weighted mean to find tighter bounds of radius, due to which the size of MEB decreases. Experiments are conducted on nine different benchmark datasets and one synthetic dataset to demonstrate the effectiveness of our proposed model. The experimental results reveal that the proposed WR-SVM significantly performed well compared to the conventional SVM classifier. Furthermore, experimental results are compared with F-SVM and traditional SVM in terms of classification accuracy to demonstrate the significance of the proposed WR-SVM.

Correlation between the structure and skin permeability of compounds

A three-descriptor quantitative structure–activity/toxicity relationship (QSAR/QSTR) model was developed for the skin permeability of a sufficiently large data set consisting of 274 compounds, by applying support vector machine (SVM) together with genetic algorithm. The optimal SVM model possesses the coefficient of determination R² of 0.946 and root mean square (rms) error of 0.253 for the training set of 139 compounds; and a R² of 0.872 and rms of 0.302 for the test set of 135 compounds. Compared with other models reported in the literature, our SVM model shows better statistical performance in a model that deals with more samples in the test set. Therefore, applying a SVM algorithm to develop a nonlinear QSAR model for skin permeability was achieved.

18F-FDG-PET/CT Whole-Body Imaging Lung Tumor Diagnostic Model: An Ensemble E-ResNet-NRC with Divided Sample Space

Under the background of ¹⁸F-FDG-PET/CT multimodal whole-body imaging for lung tumor diagnosis, for the problems of network degradation and high dimension features during convolutional neural network (CNN) training, beginning with the perspective of dividing sample space, an E-ResNet-NRC (ensemble ResNet nonnegative representation classifier) model is proposed in this paper. The model includes the following steps: (1) Parameters of a pretrained ResNet model are initialized using transfer learning. (2) Samples are divided into three different sample spaces (CT, PET, and PET/CT) based on the differences in multimodal medical images PET/CT, and ROI of the lesion was extracted. (3) The ResNet neural network was used to extract ROI features and obtain feature vectors. (4) Individual classifier ResNet-NRC was constructed with nonnegative representation NRC at a fully connected layer. (5) Ensemble classifier E-ResNet-NRC was constructed using the “relative majority voting method.” Finally, two network models, AlexNet and ResNet-50, and three classification algorithms, nearest neighbor classification algorithm (NNC), softmax, and nonnegative representation classification algorithm (NRC), were combined to compare with the E-ResNet-NRC model in this paper. The experimental results show that the overall classification performance of the Ensemble E-ResNet-NRC model is better than the individual ResNet-NRC, and specificity and sensitivity are more higher; the E-ResNet-NRC has better robustness and generalization ability.

Feature Selection Using Enhanced Particle Swarm Optimisation for Classification Models

In this research, we propose two Particle Swarm Optimisation (PSO) variants to undertake feature selection tasks. The aim is to overcome two major shortcomings of the original PSO model, i.e., premature convergence and weak exploitation around the near optimal solutions. The first proposed PSO variant incorporates four key operations, including a modified PSO operation with rectified personal and global best signals, spiral search based local exploitation, Gaussian distribution-based swarm leader enhancement, and mirroring and mutation operations for worst solution improvement. The second proposed PSO model enhances the first one through four new strategies, i.e., an adaptive exemplar breeding mechanism incorporating multiple optimal signals, nonlinear function oriented search coefficients, exponential and scattering schemes for swarm leader, and worst solution enhancement, respectively. In comparison with a set of 15 classical and advanced search methods, the proposed models illustrate statistical superiority for discriminative feature selection for a total of 13 data sets.

A New Robust Adaptive Fusion Method for Double-Modality Medical Image PET/CT

A new robust adaptive fusion method for double-modality medical image PET/CT is proposed according to the Piella framework. The algorithm consists of the following three steps. Firstly, the registered PET and CT images are decomposed using the nonsubsampled contourlet transform (NSCT). Secondly, in order to highlight the lesions of the low-frequency image, low-frequency components are fused by pulse-coupled neural network (PCNN) that has a higher sensitivity to featured area with low intensities. With regard to high-frequency subbands, the Gauss random matrix is used for compression measurements, histogram distance between the every two corresponding subblocks of high coefficient is employed as match measure, and regional energy is used as activity measure. The fusion factor $d$ is then calculated by using the match measure and the activity measure. The high-frequency measurement value is fused according to the fusion factor, and high-frequency fusion image is reconstructed by using the orthogonal matching pursuit algorithm of the high-frequency measurement after fusion. Thirdly, the final image is acquired through the NSCT inverse transformation of the low-frequency fusion image and the reconstructed high-frequency fusion image. To validate the proposed algorithm, four comparative experiments were performed: comparative experiment with other image fusion algorithms, comparison of different activity measures, different match measures, and PET/CT fusion results of lung cancer (20 groups). The experimental results showed that the proposed algorithm could better retain and show the lesion information, and is superior to other fusion algorithms based on both the subjective and objective evaluations.

Noniterative Sparse LS-SVM Based on Globally Representative Point Selection

A least squares support vector machine (LS-SVM) offers performance comparable to that of SVMs for classification and regression. The main limitation of LS-SVM is that it lacks sparsity compared with SVMs, making LS-SVM unsuitable for handling large-scale data due to computation and memory costs. To obtain sparse LS-SVM, several pruning methods based on an iterative strategy were recently proposed but did not consider the quantity constraint on the number of reserved support vectors, as widely used in real-life applications. In this article, a noniterative algorithm is proposed based on the selection of globally representative points (global-representation-based sparse least squares support vector machine, GRS-LSSVM) to improve the performance of sparse LS-SVM. For the first time, we present a model of sparse LS-SVM with a quantity constraint. In solving the optimal solution of the model, we find that using globally representative points to construct the reserved support vector set produces a better solution than other methods. We design an indicator based on point density and point dispersion to evaluate the global representation of points in feature space. Using the indicator, the top globally representative points are selected in one step from all points to construct the reserved support vector set of sparse LS-SVM. After obtaining the set, the decision hyperplane of sparse LS-SVM is directly computed using an algebraic formula. This algorithm only consumes O(N2) in computational complexity and O(N) in memory cost which makes it suitable for large-scale data sets. The experimental results show that the proposed algorithm has higher sparsity, greater stability, and lower computational complexity than the traditional iterative algorithms.

Prediction of sediment heavy metal at the Australian Bays using newly developed hybrid artificial intelligence models

Hybrid artificial intelligence (AI) models are developed for sediment lead (Pb) prediction in two Bays (i.e., Bramble (BB) and Deception (DB)) stations, Australia. A feature selection (FS) algorithm called extreme gradient boosting (XGBoost) is proposed to abstract the correlated input parameters for the Pb prediction and validated against principal component of analysis (PCA), recursive feature elimination (RFE), and the genetic algorithm (GA). XGBoost model is applied using a grid search strategy (Grid-XGBoost) for predicting Pb and validated against the commonly used AI models, artificial neural network (ANN) and support vector machine (SVM). The input parameter selection approaches redimensioned the 21 parameters into 9-5 parameters without losing their learned information over the models' training phase. At the BB station, the mean absolute percentage error (MAPE) values (0.06, 0.32, 0.34, and 0.33) were achieved for the XGBoost-SVM, XGBoost-ANN, XGBoost-Grid-XGBoost, and Grid-XGBoost models, respectively. At the DB station, the lowest MAPE values, 0.25 and 0.24, were attained for the XGBoost-Grid-XGBoost and Grid-XGBoost models, respectively. Overall, the proposed hybrid AI models provided a reliable and robust computer aid technology for sediment Pb prediction that contribute to the best knowledge of environmental pollution monitoring and assessment.

NSCR-Based DenseNet for Lung Tumor Recognition Using Chest CT Image

Nonnegative sparse representation has become a popular methodology in medical analysis and diagnosis in recent years. In order to resolve network degradation, higher dimensionality in feature extraction, data redundancy, and other issues faced when medical images parameters are trained using convolutional neural networks. Lung tumors in chest CT image based on nonnegative, sparse, and collaborative representation classification of DenseNet (DenseNet-NSCR) are proposed by this paper: firstly, initialization parameters of pretrained DenseNet model using transfer learning; secondly, training DenseNet using CT images to extract feature vectors for the full connectivity layer; thirdly, a nonnegative, sparse, and collaborative representation (NSCR) is used to represent the feature vector and solve the coding coefficient matrix; fourthly, the residual similarity is used for classification. The experimental results show that the DenseNet-NSCR classification is better than the other models, and the various evaluation indexes such as specificity and sensitivity are also high, and the method has better robustness and generalization ability through comparison experiment using AlexNet, GoogleNet, and DenseNet-201 models.