A New Improved Model of Marine Predator Algorithm for Optimization Problems

An Optimal Hierarchical Approach for Oral Cancer Diagnosis Using Rough Set Theory and an Amended Version of the Competitive Search Algorithm

Oral cancer is introduced as the uncontrolled cells' growth that causes destruction and damage to nearby tissues. This occurs when a sore or lump grows in the mouth that does not disappear. Cancers of the cheeks, lips, floor of the mouth, tongue, sinuses, hard and soft palate, and lungs (throat) are types of this cancer that will be deadly if not detected and cured in the beginning stages. The present study proposes a new pipeline procedure for providing an efficient diagnosis system for oral cancer images. In this procedure, after preprocessing and segmenting the area of interest of the inputted images, the useful characteristics are achieved. Then, some number of useful features are selected, and the others are removed to simplify the method complexity. Finally, the selected features move into a support vector machine (SVM) to classify the images by selected characteristics. The feature selection and classification steps are optimized by an amended version of the competitive search optimizer. The technique is finally implemented on the Oral Cancer (Lips and Tongue) images (OCI) dataset, and its achievements are confirmed by the comparison of it with some other latest techniques, which are weight balancing, a support vector machine, a gray-level co-occurrence matrix (GLCM), the deep method, transfer learning, mobile microscopy, and quadratic discriminant analysis. The simulation results were authenticated by four indicators and indicated the suggested method's efficiency in relation to the others in diagnosing the oral cancer cases.

Marine Predators Algorithm: A Review

Marine Predators Algorithm (MPA) is a recent nature-inspired optimizer stemmed from widespread foraging mechanisms based on Lévy and Brownian movements in ocean predators. Due to its superb features, such as derivative-free, parameter-less, easy-to-use, flexible, and simplicity, MPA is quickly evolved for a wide range of optimization problems in a short period. Therefore, its impressive characteristics inspire this review to analyze and discuss the primary MPA research studies established. In this review paper, the growth of the MPA is analyzed based on 102 research papers to show its powerful performance. The MPA inspirations and its theoretical concepts are also illustrated, focusing on its convergence behaviour. Thereafter, the MPA versions suggested improving the MPA behaviour on connecting the search space shape of real-world optimization problems are analyzed. A plethora and diverse optimization applications have been addressed, relying on MPA as the main solver, which is also described and organized. In addition, a critical discussion about the convergence behaviour and the main limitation of MPA is given. The review is end-up highlighting the main findings of this survey and suggests some possible MPA-related improvements and extensions that can be carried out in the future.

An Inclusive Survey on Marine Predators Algorithm: Variants and Applications

Marine Predators Algorithm (MPA) is the existing population-based meta-heuristic algorithms that falls under the category of Nature-Inspired Optimization Algorithm (NIOA) enthused by the foraging actions of the marine predators that principally pursues Levy or Brownian approach as its foraging strategy. Furthermore, it employs the optimal encounter rate stratagem involving both the predator as well as prey. Since its introduction by Faramarzi in the year 2020, MPA has gained enormous popularity and has been employed in numerous application areas ranging from Mathematical and Engineering Optimization problems to Fog Computing to Image Processing to Photovoltaic System to Wind-Solar Generation System for resolving continuous optimization problems. Such huge interest from the research fraternity or the massive recognition of MPA is due to several factors such as its simplicity, ease of application, realistic execution time, superior convergence acceleration rate, soaring effectiveness, its ability to unravel continuous, multi-objective and binary problems when compared with other renowned optimization algorithms existing in the literature. This paper offers a detailed summary of the Marine Predators Algorithm (MPA) and its variants. Furthermore, the applications of MPA in a number of spheres such as Image processing, classification, electrical power system, Photovoltaic models, structural damage detection, distribution networks, engineering applications, Task Scheduling, optimization problems etc., are illustrated. To conclude, the paper highlights and thereby advocates few of the potential future research directions for MPA.

Modified Marine Predators Algorithm hybridized with teaching-learning mechanism for solving optimization problems

Marine Predators Algorithm (MPA) is a newly nature-inspired meta-heuristic algorithm, which is proposed based on the Lévy flight and Brownian motion of ocean predators. Since the MPA was proposed, it has been successfully applied in many fields. However, it includes several shortcomings, such as falling into local optimum easily and precocious convergence. To balance the exploitation and exploration ability of MPA, a modified marine predators algorithm hybridized with teaching-learning mechanism is proposed in this paper, namely MTLMPA. Compared with MPA, the proposed MTLMPA has two highlights. Firstly, a kind of teaching mechanism is introduced in the first phase of MPA to improve the global searching ability. Secondly, a novel learning mechanism is introduced in the third phase of MPA to enhance the chance encounter rate between predator and prey and to avoid premature convergence. MTLMPA is verified by 23 benchmark numerical testing functions and 29 CEC-2017 testing functions. Experimental results reveal that the MTLMPA is more competitive compared with several state-of-the-art heuristic optimization algorithms.

Improving Quality Indicators of the Cloud-Based IoT Networks Using an Improved Form of Seagull Optimization Algorithm

The Internet of things (IoT) points to billions of devices located worldwide which are connected and share their data based on the Internet. Due to the new technologies that provide cheap computer chips and universal wireless networks, it is feasible that everything from a small tablet to a very large airplane will be connected to the Internet and will be a part of the IoT. In most applications, IoT network nodes face limitations in terms of energy source and cost. Therefore, the need for innovative methods to improve quality indicators that increase the lifespan of networks is evident. Here, a novel technique is presented to increase the quality of service (QoS) in IoT using an improved meta-heuristic algorithm, called the improved seagull optimization algorithm (ISOA), along with traffic management in these networks. Based on this subject, the traffic-aware algorithm can manage the sending of packets and increase the QoS provision in terms of time to a great extent. The performance evaluation of the proposed method and comparison with the previous methods demonstrated the accuracy and efficiency of this method and its superiority over the previous works.

Advanced Marine Predator Algorithm for Circular Antenna Array Pattern Synthesis

The pattern synthesis of antenna arrays is a substantial factor that can enhance the effectiveness and validity of a wireless communication system. This work proposes an advanced marine predator algorithm (AMPA) to synthesize the beam patterns of a non-uniform circular antenna array (CAA). The AMPA utilizes an adaptive velocity update mechanism with a chaotic sequence parameter to improve the exploration and exploitation capability of the algorithm. The MPA structure is simplified and upgraded to overcome being stuck in the local optimum. The AMPA is employed for the joint optimization of amplitude current and inter-element spacing to suppress the peak sidelobe level (SLL) of 8-element, 10-element, 12-element, and 18-element CAAs, taking into consideration the mutual coupling effects. The results show that it attains better performances in relation to SLL suppression and convergence rate, in comparison with some other algorithms for the optimization case.

Application of Chaos Mutation Adaptive Sparrow Search Algorithm in Edge Data Compression

In view of the large amount of data collected by an edge server, when compression technology is used for data compression, data classification accuracy is reduced and data loss is large. This paper proposes a data compression algorithm based on the chaotic mutation adaptive sparrow search algorithm (CMASSA). Constructing a new fitness function, CMASSA optimizes the hyperparameters of the Convolutional Auto-Encoder Network (CAEN) on the cloud service center, aiming to obtain the optimal CAEN model. The model is sent to the edge server to compress the data at the lower level of edge computing. The effectiveness of CMASSA performance is tested on ten high-dimensional benchmark functions, and the results show that CMASSA outperforms other comparison algorithms. Subsequently, experiments are compared with other literature on the Multi-class Weather Dataset (MWD). Experiments show that under the premise of ensuring a certain compression ratio, the proposed algorithm not only has better accuracy in classification tasks than other algorithms but also maintains a high degree of data reconstruction.

Chaos Embed Marine Predator (CMPA) Algorithm for Feature Selection

Data mining applications are growing with the availability of large data; sometimes, handling large data is also a typical task. Segregation of the data for extracting useful information is inevitable for designing modern technologies. Considering this fact, the work proposes a chaos embed marine predator algorithm (CMPA) for feature selection. The optimization routine is designed with the aim of maximizing the classification accuracy with the optimal number of features selected. The well-known benchmark data sets have been chosen for validating the performance of the proposed algorithm. A comparative analysis of the performance with some well-known algorithms advocates the applicability of the proposed algorithm. Further, the analysis has been extended to some of the well-known chaotic algorithms; first, the binary versions of these algorithms are developed and then the comparative analysis of the performance has been conducted on the basis of mean features selected, classification accuracy obtained and fitness function values. Statistical significance tests have also been conducted to establish the significance of the proposed algorithm.

An Intelligent Chimp Optimizer for Scheduling of IoT Application Tasks in Fog Computing

The cloud computing paradigm is evolving rapidly to address the challenges of new emerging paradigms, such as the Internet of Things (IoT) and fog computing. As a result, cloud services usage is increasing dramatically with the recent growth of IoT-based applications. To successfully fulfill application requirements while efficiently harnessing cloud computing power, intelligent scheduling approaches are required to optimize the scheduling of IoT application tasks on computing resources. In this paper, the chimp optimization algorithm (ChOA) is incorporated with the marine predators algorithm (MPA) and disruption operator to determine the optimal solution to IoT applications’ task scheduling. The developed algorithm, called CHMPAD, aims to avoid entrapment in the local optima and improve the exploitation capability of the basic ChOA as its main drawbacks. Experiments are conducted using synthetic and real workloads collected from the Parallel Workload Archive to demonstrate the applicability and efficiency of the presented CHMPAD method. The simulation findings reveal that CHMPAD can achieve average makespan time improvements of 1.12–43.20% (for synthetic workloads), 1.00–43.43% (for NASA iPSC workloads), and 2.75–42.53% (for HPC2N workloads) over peer scheduling algorithms. Further, our evaluation results suggest that our proposal can improve the throughput performance of fog computing.

Multi-Classification of Brain Tumors on Magnetic Resonance Images Using an Ensemble of Pre-Trained Convolutional Neural Networks

BACKGROUND

Automatic classification of brain tumors is an important issue in computeraided diagnosis (CAD) for medical applications since it can efficiently improve the clinician's diagnostic performance and the current study focused on the CAD system of the brain tumors.

METHODS

Existing studies mainly focused on a single classifier either based on traditional machinelearning algorithms or deep learning algorithms with unsatisfied results. In this study, we proposed an ensemble of pre-trained convolutional neural networks to classify brain tumors into three types from their T1-weighted contrast-enhanced MRI (CE-MRI) images, which are meningioma, glioma, and pituitary tumor. Three pre-trained convolutional neural networks (Inception-v3, Resnet101, Densenet201) with the best classification performance (i.e. accuracy of 96.21%, 97.00%, 96.54%, respectively) on the CE-MRI benchmark dataset were selected as backbones of the ensemble model. The features extracted by backbone networks in the ensemble model were further classified by a support vector machine.

RESULTS

The ensemble system achieved an average classification accuracy of 98.14% under a five-fold cross-validation process, outperforming any single deep learning model in the ensemble system and other methods in the previous studies. Performance metrics for each brain tumor type, including area under the curve, sensitivity, specificity, precision, and F-score, were calculated to show the ensemble system's performance. Our work addressed a practical issue by evaluating the model with fewer training samples. The classification accuracy was reduced to 97.23%, 96.87%, and 93.96% when 75%, 50%, and 25% training data was used to train the ensemble model, respectively.

CONCLUSION

Our ensemble model has a great capacity and achieved the best performance in any single convolutional neural networks for brain tumors classification and is potentially applicable in real clinical practice.

COVID-19 Diagnosis from CT Images with Convolutional Neural Network Optimized by Marine Predator Optimization Algorithm

In recent years, almost every country in the world has struggled against the spread of Coronavirus Disease 2019. If governments and public health systems do not take action against the spread of the disease, it will have a severe impact on human life. A noteworthy technique to stop this pandemic is diagnosing COVID-19 infected patients and isolating them instantly. The present study proposes a method for the diagnosis of COVID-19 from CT images. The method is a hybrid method based on convolutional neural network which is optimized by a newly introduced metaheuristic, called marine predator optimization algorithm. This optimization method is performed to improve the system accuracy. The method is then implemented on the chest CT scans with the COVID-19-related findings (MosMedData) dataset, and the results are compared with three other methods from the literature to indicate the method's performance. The final results indicate that the proposed method with 98.11% accuracy, 98.13% precision, 98.66% sensitivity, and 97.26% F1 score has the highest performance in all indicators than the compared methods which shows its higher accuracy and reliability.

Skin Cancer Detection Using Kernel Fuzzy C-Means and Improved Neural Network Optimization Algorithm

Early diagnosis of malignant skin cancer from images is a significant part of the cancer treatment process. One of the principal purposes of this research is to propose a pipeline methodology for an optimum computer-aided diagnosis of skin cancers. The method contains four main stages. The first stage is to perform a preprocessing based on noise reduction and contrast enhancement. The second stage is to segment the region of interest (ROI). This study uses kernel fuzzy C-means for ROI segmentation. Then, some features from the ROI are extracted, and then, a feature selection is used for selecting the best ones. The selected features are then injected into a support vector machine (SVM) for final identification. One important part of the contribution in this study is to propose a developed version of a new metaheuristic, named neural network optimization algorithm, to optimize both parts of feature selection and SVM classifier. Comparison results of the method with 5 state-of-the-art methods showed the approach's higher superiority toward the others.