Reliable Machine Learning Model for IIoT Botnet Detection

Due to the growing number of Internet of Things (IoT) devices, network attacks like denial of service (DoS) and floods are rising for security and reliability issues. As a result of these attacks, IoT devices suffer from denial of service and network disruption. Researchers have implemented different techniques to identify attacks aimed at vulnerable Internet of Things (IoT) devices. In this study, we propose a novel features selection algorithm FGOA-kNN based on a hybrid filter and wrapper selection approaches to select the most relevant features. The novel approach integrated with clustering rank the features and then applies the Grasshopper algorithm (GOA) to minimize the top-ranked features. Moreover, a proposed algorithm, IHHO, selects and adapts the neural network’s hyper parameters to detect botnets efficiently. The proposed Harris Hawks algorithm is enhanced with three improvements to improve the global search process for optimal solutions. To tackle the problem of population diversity, a chaotic map function is utilized for initialization. The escape energy of hawks is updated with a new nonlinear formula to avoid the local minima and better balance between exploration and exploitation. Furthermore, the exploitation phase of HHO is enhanced using a new elite operator ROBL. The proposed model combines unsupervised, clustering, and supervised approaches to detect intrusion behaviors. The N-BaIoT dataset is utilized to validate the proposed model. Many recent techniques were used to assess and compare the proposed model’s performance. The result demonstrates that the proposed model is better than other variations at detecting multiclass botnet attacks

Improved Reptile Search Optimization Algorithm using Chaotic map and Simulated Annealing for Feature Selection in Medical Filed

The increased volume of medical datasets has produced high dimensional features, negatively affecting machine learning (ML) classifiers. In ML, the feature selection process is fundamental for selecting the most relevant features and reducing redundant and irrelevant ones. The optimization algorithms demonstrate its capability to solve feature selection problems. Reptile Search Algorithm (RSA) is a new nature-inspired optimization algorithm that stimulates Crocodiles’ encircling and hunting behavior. The unique search of the RSA algorithm obtains promising results compared to other optimization algorithms. However, when applied to high-dimensional feature selection problems, RSA suffers from population diversity and local optima limitations. An improved metaheuristic optimizer, namely the Improved Reptile Search Algorithm (IRSA), is proposed to overcome these limitations and adapt the RSA to solve the feature selection problem. Two main improvements adding value to the standard RSA; the first improvement is to apply the chaos theory at the initialization phase of RSA to enhance its exploration capabilities in the search space. The second improvement is to combine the Simulated Annealing (SA) algorithm with the exploitation search to avoid the local optima problem. The IRSA performance was evaluated over 20 medical benchmark datasets from the UCI machine learning repository. Also, IRSA is compared with the standard RSA and state-of-the-art optimization algorithms, including Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Grasshopper Optimization algorithm (GOA) and Slime Mould Optimization (SMO). The evaluation metrics include the number of selected features, classification accuracy, fitness value, Wilcoxon statistical test (p-value), and convergence curve. Based on the results obtained, IRSA confirmed its superiority over the original RSA algorithm and other optimized algorithms on the majority of the medical datasets

Enhancing Feature Selection Accuracy using Butterfly and Lion Optimization Algorithm with Specific Reference to Psychiatric Disorder Detection & Diagnosis

As the complexity of medical computing increases the use of intelligent methods based on methods of soft computing also increases. During current decade this intelligent computing involves various meta-heuristic algorithms for Optimization. Many new meta-heuristic algorithms are proposed in last few years. The dimension of this data has also wide. Feature selection processes play an important role in these types of wide data. In intelligent computation feature selection is important phase after the pre-processing phase. The success of any model depends on how better optimization algorithms is used. Sometime single optimization algorithms are not enough in order to produce better result. In this paper meta-heuristic algorithm like butterfly optimization algorithm and enhanced lion optimization algorithm are used to show better accuracy in feature selection. The study focuses on nature based integrated meta-heuristic algorithm like Butterfly Optimization and lion-based optimization. Also, in this paper various other Optimization algorithms are analyzed. The study shows how integrated methods are useful to enhance the accuracy of any computing model to solve Complex problems. Here experimental result has shown by proposing and hybrid model for two major psychiatric disorders one is known as autism spectrum and second one is Parkinson's disease

An Improved Water Strider Algorithm for Optimal Design of Skeletal Structures

Water Strider Algorithm (WSA) is a new metaheuristic method that is inspired by the life cycle of water striders. This study attempts to enhance the performance of the WSA in order to improve solution accuracy, reliability, and convergence speed. The new method, called improved water strider algorithm (IWSA), is tested in benchmark mathematical functions and some structural optimization problems. In the proposed algorithm, the standard WSA is augmented by utilizing an opposition-based learning method for the initial population as well as a mutation technique borrowed from the genetic algorithm. By employing Generalized Space Transformation Search (GSTS) as an opposition-based learning method, more promising regions of the search space are explored; therefore, the precision of the results is enhanced. By adding a mutation to the WSA, the method is helped to escape from local optimums which is essential for engineering design problems as well as complex mathematical optimization problems. First, the viability of IWSA is demonstrated by optimizing benchmark mathematical functions, and then it is applied to three skeletal structures to investigate its efficiency in structural design problems. IWSA is compared to the standard WSA and some other state-of-the-art metaheuristic algorithms. The results show the competence and robustness of the IWSA as an optimization algorithm in mathematical functions as well as in the field of structural optimization

Chaos embedded opposition based learning for gravitational search algorithm

Due to its robust search mechanism, Gravitational search algorithm (GSA) has achieved lots of popularity from different research communities. However, stagnation reduces its searchability towards global optima for rigid and complex multi-modal problems. This paper proposes a GSA variant that incorporates chaos-embedded opposition-based learning into the basic GSA for the stagnation-free search. Additionally, a sine-cosine based chaotic gravitational constant is introduced to balance the trade-off between exploration and exploitation capabilities more effectively. The proposed variant is tested over 23 classical benchmark problems, 15 test problems of CEC 2015 test suite, and 15 test problems of CEC 2014 test suite. Different graphical, as well as empirical analyses, reveal the superiority of the proposed algorithm over conventional meta-heuristics and most recent GSA variants.Comment: 33 pages, 5 Figure

Optimal Allocation/Sizing of DGs/Capacitors in Reconfigured Radial Distribution System using Quasi-Reflected Slime Mould Algorithm

Increased load demands worsen distribution system problems such as greater line losses, voltage deviation and a plethora of other concerns. This current work presents an approach stressing simultaneous optimal allocation and sizing of capacitor banks and distributed generations, as well as optimal radial distribution system (RDS) reconfiguration, to address these difficulties. The above objectives are accomplished through the maiden application of the proposed quasi-reflection-based slime mould algorithm (QRSMA). The efficacy of QRSMA is established by testing it on different benchmark functions. A new modified backward forward load flow approach is also proposed and validated by comparing its results to those obtained using MATPOWER software for IEEE 69, 85, and 118 bus RDSs. The proposed load flow technique is independent of the sequential bus numbering scheme and may be applied to any RDS network topology. The proposed QRSMA is tested on 118 bus RDS and to prove its effectiveness; its results are compared to those of other studied algorithms. The study takes into account both fixed and variable loading scenarios. A cost-benefit analysis of the strategy is also performed in order to make the methodology more realistic.publishedVersio

VGG19+CNN: Deep Learning-Based Lung Cancer Classification with Meta-Heuristic Feature Selection Methodology

Lung illnesses are lung-affecting illnesses that harm the respiratory mechanism. Lung cancer is one of the major causes of death in humans internationally. Advance diagnosis could optimise survivability amongst humans. This remains feasible to systematise or reinforce the radiologist for cancer prognosis. PET and CT scanned images can be used for lung cancer detection. On the whole, the CT scan exhibits importance on the whole and functions as a comprehensive operation in former cancer prognosis. Thus, to subdue specific faults in choosing the feature and optimise classification, this study employs a new revolutionary algorithm called the Accelerated Wrapper-based Binary Artificial Bee Colony algorithm (AWBABCA) for effectual feature selection and VGG19+CNN for classifying cancer phases. The morphological features will be extracted out of the pre-processed image; next, the feature or nodule related to the lung that possesses a significant impact on incurring cancer will be chosen, and for this intention, herein AWBABCA has been employed. The chosen features will be utilised for cancer classification, facilitating a great level of strength and precision. Using the lung dataset to do an experimental evaluation shows that the proposed classifier got the best accuracy, precision, recall, and f1-score

Optimization Methods for Image Thresholding: A review

Setting a border with the proper gray level in processing images to separate objects from their backgrounds is crucial. One of the simplest and most popular methods of segmenting pictures is histogram-based thresholding. Thresholding is a common technique for image segmentation because of its simplicity. Thresholding is used to separate the Background of the image from the Foreground. There are many methods of thresholding. This paper aims to review many previous studies and mention the types of thresholding. It includes two types: the global and local thresholding methods and each type include a group of methods. The global thresholding method includes (the Otsu method, Kapur's entropy method, Tsallis entropy method, Hysteresis method, and Fuzzy entropy method), and the local thresholding method includes ( Ni-Black method and Bernsen method). The optimization algorithms(Genetic Algorithm, Particle Swarm Optimization, Bat Algorithm, Modified Grasshopper Optimization, Firefly Algorithm, Cuckoo Search, Tabu Search Algorithm, Simulated Annealing, and Jaya Algorithm) used along with thresholding methods are also illustrated

A Hybrid Chimp Optimization Algorithm and Generalized Normal Distribution Algorithm with Opposition-Based Learning Strategy for Solving Data Clustering Problems

This paper is concerned with data clustering to separate clusters based on the connectivity principle for categorizing similar and dissimilar data into different groups. Although classical clustering algorithms such as K-means are efficient techniques, they often trap in local optima and have a slow convergence rate in solving high-dimensional problems. To address these issues, many successful meta-heuristic optimization algorithms and intelligence-based methods have been introduced to attain the optimal solution in a reasonable time. They are designed to escape from a local optimum problem by allowing flexible movements or random behaviors. In this study, we attempt to conceptualize a powerful approach using the three main components: Chimp Optimization Algorithm (ChOA), Generalized Normal Distribution Algorithm (GNDA), and Opposition-Based Learning (OBL) method. Firstly, two versions of ChOA with two different independent groups' strategies and seven chaotic maps, entitled ChOA(I) and ChOA(II), are presented to achieve the best possible result for data clustering purposes. Secondly, a novel combination of ChOA and GNDA algorithms with the OBL strategy is devised to solve the major shortcomings of the original algorithms. Lastly, the proposed ChOAGNDA method is a Selective Opposition (SO) algorithm based on ChOA and GNDA, which can be used to tackle large and complex real-world optimization problems, particularly data clustering applications. The results are evaluated against seven popular meta-heuristic optimization algorithms and eight recent state-of-the-art clustering techniques. Experimental results illustrate that the proposed work significantly outperforms other existing methods in terms of the achievement in minimizing the Sum of Intra-Cluster Distances (SICD), obtaining the lowest Error Rate (ER), accelerating the convergence speed, and finding the optimal cluster centers.Comment: 48 pages, 14 Tables, 12 Figure

Obstacle Avoidance Scheme Based Elite Opposition Bat Algorithm for Unmanned Ground Vehicles

Unmanned Ground Vehicles (UGVs) are intelligent vehicles that operate in an obstacle environment without an onboard human operator but can be controlled autonomously using an obstacle avoidance system or by a human operator from a remote location. In this research, an obstacle avoidance scheme-based elite opposition bat algorithm (EOBA) for UGVs was developed. The obstacle avoidance system comprises a simulation map, a perception system for obstacle detection, and the implementation of EOBA for generating an optimal collision-free path that led the UGV to the goal location. Three distance thresholds of 0.1 m, 0.2 m, and 0.3 m was used in the obstacle detection stage to determine the optimal distance threshold for obstacle avoidance. The performance of the obstacle avoidance scheme was compared with that of bat algorithm (BA) and particle swarm optimization (PSO) techniques. The simulation results show that the distance threshold of 0.3 m is the optimal threshold for obstacle avoidance provided that the size of the obstacle does not exceed the size of the UGV. The EOBA based scheme when compared with BA and PSO schemes obtained an average percentage reduction of 21.82% in terms of path length and 60% in terms of time taken to reach the target destination. The uniqueness of this approach is that the UGV avoid collision with an obstacle at a distance of 0.3 m from nearby obstacles as against taking three steps backward before avoiding obstacl