This manuscript presents a comprehensive approach to enhance the accuracy of skin lesion image classification based on the HAM10000 and BCN20000 datasets. Building on prior feature fusion models, this research introduces an optimized cluster-based fusion approach to address limitations observed in our previous methods. The study proposes two novel feature fusion strategies, KFS-MPA (using K-means) and DFS-MPA (using DBSCAN), for skin lesion classification. These approaches leverage optimized clustering-based deep feature fusion and the marine predator algorithm (MPA). Ten fused feature sets are evaluated using three classifiers on both datasets, and their performance is compared in terms of dimensionality reduction and accuracy improvement. The results consistently demonstrate that the DFS-MPA approach outperforms KFS-MPA and other compared fusion methods, achieving notable dimensionality reduction and the highest accuracy levels. ROC-AUC curves further support the superiority of DFS-MPA, highlighting its exceptional discriminative capabilities. Five-fold cross-validation tests and a comparison with the previously proposed feature fusion method (FOWFS-AJS) are performed, confirming the effectiveness of DFS-MPA in enhancing classification performance. The statistical validation based on the Friedman test and Bonferroni-Dunn test also supports DFS-MPA as a promising approach for skin lesion classification among the evaluated feature fusion methods. These findings emphasize the significance of optimized cluster-based deep feature fusion in skin lesion classification and establish DFS-MPA as the preferred choice for feature fusion in this study.

Influence maximization (IM) in dynamic social networks is an optimization problem to analyze the changes in social networks for different periods. However, the existing IM methods ignore the context propagation of interaction behaviors among users. Hence, context-based IM in multiplex networks is proposed here. Initially, multiplex networks along with their contextual data are taken as input. Community detection is performed for the network using the Wilcoxon Hypothesized K-Means (WH-KMA) algorithm. From the detected communities, the homogeneous network is used for extracting network topological features, and the heterogeneous networks are used for influence path analysis based on which the node connections are weighted. Then, the influence-path-based features along with contextual features are extracted. These extracted features are given for the link prediction model using the Parametric Probability Theory-based Long Short-Term Memory (PPT-LSTM) model. Finally, from the network graph, the most influencing nodes are identified using the Linear Scaling based Clique (LS-Clique) detection algorithm. The experimental outcomes reveal that the proposed model achieves an enhanced performance.

Incremental learning relies on the availability of ample training data for novel classes, a requirement that is often unfeasible in various application scenarios, particularly when new classes are rare groups that are pricey or challenging to attain. The main focus of incremental learning is on the tricky task of continuously learning to classify new classes in incoming data with no erasing knowledge of old classes. The research intends to develop a comparative analysis of optimization algorithms in training few-shot continual learning models to conquer catastrophic forgetting. The presented mechanism integrates various steps: pre-processing and classification. Images are initially pre-processed through contrast enhancement to elevate their quality. Pre-processed outputs are then classified by employing Continually Evolved Classifiers, generated to address a matter of catastrophic forgetting. Furthermore, to further enhance performance, Serial Exponential Sand Cat Swarm optimization algorithm (SE-SCSO) is employed and compared against ten other algorithms, containing Grey Wolf Optimization (GWO) algorithm, Moth flame optimization (MFO), cuckoo Search Optimization Algorithm (CSOA), Elephant Search Algorithm (ESA), Whale Optimization Algorithm (WOA), Artificial Algae Algorithm (AAA), Cat Swarm Optimization (CSO), Fish Swarm Algorithm (FSA), Genetic Bee Colony (GBC) Algorithm, and Particle swarm optimization (PSO). From the experiment results, SE-SCSO had attained the maximum performance with an accuracy of 89.6%, specificity of 86%, precision of 83%, recall of 92.3% and f-measure of 87.4%.

Erythemato-squamous Diseases (ESD) encompass a group of common skin conditions, including psoriasis, seborrheic dermatitis, lichen planus, pityriasis rosea, chronic dermatitis, and pityriasis rubra pilaris. These dermatological conditions affect a significant portion of the population and present a current challenge for accurate diagnosis and classification. Traditional classification methods struggle due to shared characteristics among these diseases. Machine Learning offers a valuable tool for aiding clinical decision-making in ESD classification. In this study, we leverage the UC Irvine (UCI) dermatology dataset by applying necessary preprocessing steps to handle missing data. We conduct a comparative analysis of two feature selection methods: One-way ANOVA and Chi-square test. To enhance the model’s performance, we employ hyper-parameter tuning through GridSearchCV. The training process encompasses various algorithms, including Support Vector Machine (SVM), Logistic Regression, k-Nearest Neighbors (kNN), and Decision Trees. The culmination of our work is a hybrid ensemble machine learning model that combines the strengths of the trained classifiers. This ensemble classifier achieves an impressive accuracy of 98.9% when validated using a 10-fold cross-validation approach.

This paper provides a concise overview of a grammatical error correction algorithm based on the encoder-decoder structure. The traditional unidirectional long short-term memory (LSTM) in the encoder was transformed into a bidirectional LSTM. Subsequently, the grammatical error correction algorithm was simulated and experimented with. In the experiments, it was compared with two other error correction algorithms: one based on the LSTM classification model and the other on the traditional unidirectional LSTM translation model. The results indicated that the three error correction algorithms exhibited little difference in detection performance when faced with distinct corpus databases. Furthermore, when dealing with the same corpus database, the bidirectional LSTM algorithm demonstrated the most robust detection performance, followed by the one based on the traditional unidirectional LSTM translation model, and lastly, the one based on the LSTM classification model performed the least effectively.

Graphical passwords or passphrases (GPs) are examined as reliable authentication system over text-based passphrases. Several obtainable applications utilize GPs and image-based authentication schemes. Even though, these authentication methods experience an issue of managing image or pictorial data. Here, Natural Language Processing (NLP)+Stable Diffusion (SD)_graphical authentication is presented for graphical authentication using passphrase. The passphrase, removing stop words, spell check, similarity check, stemming and lemmatization, label encoder, positional embedding and encryption are the steps carried out in registration phase whereas decryption Advanced Encryption Standard (AES), sentence generation, image set generation and grid module are conducted in verification phase. Initially, passphrase is considered and then, stop words are removed from it. Thereafter, spell check as well as similarity check are done and after these processes stemming and lemmatization is performed. In label encoder, label is generated for individual word in passphrase. Afterwards, positional embedding is done and lastly, encryption is conducted in registration phase. In verification phase, encrypted passphrase is decrypted, sentence is generated utilizing Generative Pre-trained Transformer (GPT), image set is generated by SD model and finally, image grid module is accomplished. Moreover, NLP+SD_graphical authentication achieved minimum attack detection, login failure, login time about 0.598, 0.191, 14.175sec and maximum memorability about 0.932.

Lithium-ion batteries are widely utilized in a variety of transportation sectors, including highways, airplanes, and defensive military applications because of their positive features, which include a low self-discharge rate, raised operating voltage, prolonged cycle life, and high energy density. Nevertheless, during operation, the battery undergoes adverse reactions that may eventually cause material aging and capacity deterioration. For this reason, the prediction of remaining useful life (RUL) for LiBs is important and necessary for ensuring reliable system operation. Moreover, accurate RUL prediction can effectively offer maintenance strategies to certify the system’s dependability and safety. The impedance of the battery plays a vital role in the degradation process and hence its measurement accounts for the changes in the battery’s internal parameters as aging occurs. The objective of this paper is to create a forecasting model for the lifespan of batteries through the application of data analysis. Moreover, it aims to use a Regression Neural Network (RNN) based mathematical model to assess the degradation of the battery across diverse operational scenarios. The co-efficient of the RNN model is found by solving the RNN equations. In this research, MATLAB is employed for data analysis, utilizing open-source battery data sourced from the NASA dataset. The conclusive prediction outcomes indicate the effectiveness of the proposed methodology in accurately forecasting the battery RUL.

In order to identify and locate flaws in solar thermal images, this research suggests using an optimization-tuned CNN classifier. The input thermal images are initially pre-processed to remove the noise present in them. After pre-processing, features like LBP, LDP, and LOOP are extracted. The collected features are then combined to produce a feature vector, which is the input to the proposed CNN classifier. Single hotspots, multiple hotspots, and string hotspots are the three types of faults that are supposed to be classified. After the classification process, the defects are located using the VGG-16 model. The weights of the CNN and VGG-16 models are modified using the proposed AqWH algorithm, which includes the distinctive characteristics of the wild horse and the Aquila search agents, to enhance classification and localization accuracy. The suggested possesses accuracy levels of 90% for classification and 96.11% for localization tasks, showing its superiority over conventional methods.

A promoter is a brief stretch of DNA (100–1,000 bp) where RNA polymerase starts to transcribe a gene. A DNA (Deoxyribonucleic Acid) base pair is a fundamental unit of DNA structure and represents the pairing of two complementary nucleotide bases within the DNA double helix. The four DNA nucleotide bases are adenine (A), thymine (T), cytosine (C), and guanine (G). DNA base pairs are the building blocks of the DNA molecule, and their complementary pairing is central to the storage and transmission of genetic information in all living organisms. Normally, a promoter is found at the 5′ end of the transcription initiation site or immediately upstream. Numerous human disorders, particularly diabetes, cancer, and Huntington’s disease, have been shown to have DNA promoter as their root cause. The scientific community has long been interested in learning crucial information about protein-coding genes. Finding the promoters is therefore the first step in finding genes in DNA sequences. The scientific world has always been attracted by the effort to glean crucial knowledge about protein-coding genes. Consequently, identifying promoters has emerged as an intriguing challenge that has caught the interest of numerous researchers in the field of bioinformatics. We proposed Gaussian Decision Boundary Estimation in machine learning models to detect transcription start sites (promoters) in the DNA sequences of a common bacteria, Escherichia coli. The best features are identified through a score-based function to select relevant nucleotides that are directly responsible for promoter recognition, in order maximise the models’ performance. The Gaussian Decision Boundary Estimation based support-vector-machine model is trained with these features and finds the best hyperplane that separates the data into different classes. Throughout this study, promoter regions could be identified with high accuracy 99.9% which is better compared to other state of art algorithms. The comparison of machine learning classification models is another major emphasis of this paper in order to identify the model that most accurately predicts DNA sequence promoters. It provides analysis for further biological research as well as precision medicine.

The Extreme Learning Machine (ELM) is a highly efficient model for real-time network retraining due to its fast learning speed, unlike traditional machine learning methods. However, the performance of ELM can be negatively impacted by the random initialization of weights and biases. Moreover, poor input feature quality can further degrade performance, particularly with complex visual data. To overcome these issues, this paper proposes optimizing the input features as well as the initial weights and biases. We combine both Convolutional Neural Network (CNN) and Convolutional AutoEncoder (CAE) extracted features to optimize the quality of the input features. And we use our hybrid Grey Wolf Optimizer-Multi-Verse Optimizer (GWO-MVO) metaheuristic for initializing weights and biases by applying four fitness functions based on: the norm of the output weights, the error rate on the training set, and the error rate on the validation set. Our method is evaluated on image classification tasks using two benchmark datasets: CIFAR-10 and CIFAR-100. Since image quality may vary in real-world applications, we trained and tested our models on the dataset’s original and noisy versions. The results demonstrate that our method provides a robust and efficient alternative for image classification tasks, offering improved accuracy and reduced overfitting.