Binary Bat Algorithm Research Articles

Gene selection and cancer classification using interaction-based feature clustering and improved-binary Bat algorithm

In high-dimensional gene expression data, selecting an optimal subset of genes is crucial for achieving high classification accuracy and reliable diagnosis of diseases. This paper proposes a two-stage hybrid model for gene selection based on clustering and a swarm intelligence algorithm to identify the most informative genes with high accuracy. First, a clustering-based multivariate filter approach is performed to explore the interactions between the features and eliminate any redundant or irrelevant ones. Then, by controlling for the problem of premature convergence in the binary Bat algorithm, the optimal gene subset is determined using different classifiers with the Monte Carlo cross-validation data partitioning model. The effectiveness of our proposed framework is evaluated using eight gene expression datasets, by comparison with other recently published algorithms in the literature. Experiments confirm that in seven out of eight datasets, the proposed method can achieve superior results in terms of classification accuracy and gene subset size. In particular, it achieves a classification accuracy of 100% in Lymphoma and Ovarian datasets and above 97.4% in the rest with a minimum number of genes. The results demonstrate that our proposed algorithm has the potential to solve the feature selection problem in different applications with high-dimensional datasets.

Automatic phishing website detection and prevention model using transformer deep belief network

In the digitally connected world cybersecurity is paramount, phishing where attackers pose as trusted entities to steal sensitive data, looms large. The proliferation of phishing attacks on the internet poses a substantial threat to individuals and organizations, compromising sensitive information and causing financial and reputational damage. This study's goal is to establish an automated system for the early detection and prevention of phishing websites, thereby enhancing online security and protecting users from cyber threats. This research initially employs One Hot Encoding (OHE) mechanism-based pre-processing mechanism that converts every URL string into a numerical vector with a particular dimension. This study utilizes two feature selection techniques which are transfer learning-based feature extraction using DarkNet19 and Variational Autoencoder (VAE) to select the value of the most important feature. The robust security mechanisms are presented to prevent phishing attacks and safeguard personal information on websites. List-based deep learning-based systems to prevent and detect phishing URLs more efficiently. The study proposes a transformer-based Deep Belief Network (TB-DBN), a veritable pre-trained deep transformer network model for phishing behaviour detection. A cross-validation technique with grid search hyper-parameter tuning based on the Intelligence Binary Bat Algorithm (IBBA) was designed using the proposed hybrid model. Predictions were made to classify the phishing URLs using a probabilistic estimation guided boosting classifier model and evaluate their performance in terms of accuracy, precision, recall, specificity, and F1- score. The risk level associated with the URL will be assessed based on various factors, such as the source's reputation, content analysis results, and behavioural anomalies. The computational complexity of DL model training is influenced by various factors, such as the model's complexity, the training data's size, and the optimization algorithm exploited, for training. The outcome demonstrates that tweaking variables increases the effectiveness of Python-based deep learning systems. The findings of the proposed method excel, achieving an accuracy of 99.4 %, precision of 99.2 %, recall of 99.3 %, and an F1-score of 99.2 %. This innovative automatic phishing website detection and prevention model, based on a Transformer-based Deep Belief Network, offers advanced accuracy and adaptability, strengthening cybersecurity measures to safeguard sensitive user information and mitigate the substantial threat of phishing attacks in the digitally connected world.

Energy efficient scheme for improving network lifetime using BAT algorithm in wireless sensor network

SummaryWireless sensor networks consist of several autonomous nodes that are outfitted with sensors, radio, processors, memory storage, and power sources. These nodes track, sense, and send data using radio. While establishing a network, the two most essential characteristics are coverage and connectivity. For better connectivity and a longer network life, it's important to make the coverage area as big as possible with the fewest number of sensor nodes. The goal of this research is to make a connected sensor network that uses less energy and can be used in situations where the sensors need to be placed in the best way to make the network last as long as possible. The probabilistic sensing model is used, and improved network lifetime is the goal of the research work by using problem‐specific intelligent optimization techniques like BAT, ACO, and JOA to maximize the coverage area with respect to energy and points of interest. This work introduces a novel approach that optimizes both coverage and connectivity. The modified binary bat algorithm overcomes computational complexities and local optima observed in existing methods. Uniquely, it models the three states of each sensor node and includes innovative features like a greedy initialization and a weighted cost function for improving network efficiency. After investigation, it was analyzed that the proposed solution significantly improves network lifetime by over 10% to 12% compared to existing methods like JOA and ACO. The proposed approach converges faster and performs more efficiently.

Credit card fraud detection using the brown bear optimization algorithm

Fraud detection in banking systems is crucial for financial stability, customer protection, reputation management, and regulatory compliance. Machine Learning (ML) is vital in improving data analysis, real-time fraud detection, and developing fraud techniques by learning from data and adjusting detection strategies accordingly. Feature Selection (FS) is essential for enhancing fraud detection through ML to achieve optimal model accuracy. This is because it helps to eliminate the negative impact of redundant and irrelevant attributes. To enhance the accuracy of the given dataset, the researchers utilized multiple methods to determine the most fitting features. However, it is important to note that when implementing these methods on datasets with larger feature sizes, they may encounter issues with local optimality. Despite this, the researchers continue to work on improving the effectiveness of these methods. This study presents an effective methodology based on the Brown-Bear Optimization (BBO) algorithm to enhance the capacity to accurately identify financial CCF transactions by recognizing pertinent features. BBO has balanced capabilities to reduce dimensionality while enhancing classification accuracy. It is improved by adjusting the positions randomly to enhance exploration and exploitation capabilities, and then it is cloned into a binary variant named Binary BBOA (BBBOA). The Support Vector Machine (SVM), k-nearest Neighbor (k-NN), and Xgb-tree are the ML classifiers used with the suggested methodology. On the Australian credit dataset, the proposed methodology is compared with the basic BBOA and ten current optimizers, such as Binary African Vultures Optimization (BAVO), Binary Salp Swarm Algorithm (BSSA), Binary Atom Search Optimization (BASO), Binary Henry Gas Solubility Optimization (BHGSO), Binary Harris Hawks Optimization (BHHO), Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO), Binary Grasshopper Optimization Algorithm (BGOA), and Binary Sailfish Optimizer (BSFO). Regarding Wilcoxon’s rank-sum test (α=0.05), the superiority and effective consequence of the presented methodology are clear on the utilized dataset and got an accuracy of classification up to 91% in the utilized dataset combined with an attribute reduction length down to 67%. The proposed methodology is further validated using 10 benchmark datasets and outperformed its competitors in most utilized datasets regarding different performance measures. In the end, the proposed methodology is further validated using ten benchmark datasets from the UCI repository. It outperformed its competitors in most of the utilized datasets regarding different performance measures.

OPTIMIZING HEART ATTACK DIAGNOSIS USING RANDOM FOREST WITH BAT ALGORITHM AND GREEDY CROSSOVER TECHNIQUE

Cardiovascular disease stands as one of the primary contributors to global mortality, with the World Health Organization (WHO) reporting approximately 17.9 million deaths annually. Swift and accurate diagnosis of heart attacks is crucial to ensure timely and specialized intervention for patients afflicted by this ailment. A machine learning algorithm that can be employed for addressing such issues is the Random Forest algorithm. However, the efficacy of the model is significantly influenced by the features selected during the training phase. To mitigate this, the Binary Bat Algorithm (BBA) with greedy crossover has been utilized to enhance feature selection within the model. This approach is particularly adept at preventing convergence issues often associated with local minima. The optimal parameters for BBA with greedy crossover are determined to be , , , and . With these parameters, the proposed algorithm identifies the most relevant features, including age, gender, cp, chol, thalach, oldpeak, slope, and ca, achieving an accuracy of 94.19% on the training data and 91.8% on the test data. Furthermore, the precision and recall values for both classes range from 0.87 to 0.96, contributing to an approximate -score of 0.92. The proposed method has increased its -score by 0.05 if compared with the regular Random Forest model. These results underscore the effectiveness of the proposed algorithm in providing accurate and reliable predictions for heart disease diagnosis. As such, this model makes diagnosing heart attack more convenient and effective because it does not require too much medical features or patient data. Hopefully, the results of this research help medical practitioners make better and timely decisions in the diagnosis and treatment of heart attacks, as well as assist in planning more effective public health programs for heart attack prevention.

A Novel Hybrid Binary Bat Algorithm for Global Optimization

In this article, a novel hybrid binary bat algorithm named HBBA is proposed for global optimization problems. First, to avoid simultaneous updating of bat velocity's dimensional components, i.e., elements of velocity vector, a random black hole model is modified to adapt to binary algorithm for updating in unknown spaces for each dimensional component individually. Through this way, the search ability of bats around the current group best is increased greatly. Second, a time-varying v-shaped transfer function, rather than a time-invariant one as in closely related works, is proposed to map velocity in continuous search space to a binary one. This accelerates the speed to switch individuals' positions, i.e., solutions in binary space. Third, a chaotic map is utilized to replace monotonous parameters in original binary bat algorithm, which is beneficial for avoiding premature convergence. Simulation results demonstrate the effectiveness of the proposed algorithm by three types of benchmark functions and unit commitment problem.

Improved Binary Meerkat Optimization Algorithm for efficient feature selection of supervised learning classification

Feature selection (FS) is a crucial step in machine learning and data mining projects. It aims to remove redundant and uncorrelated features, thus improving the accuracy of models. However, it can be challenging to select the optimal features, especially for datasets with many features. This paper proposes the Binary Meerkat Optimization Algorithm (BMOA) to address the issue of FS. The BMOA selects the most related and useful features. Additionally, an improved BMOA (IBMOA) is introduced, which enhances exploration and exploitation capabilities by incorporating the Periodic Mode Boundary Handling (PMBH) strategy and the Local Search (LS) process. This helps to reduce dimensionality and enhance classification accuracy. To evaluate the significance of selected features, two widely used classifiers, namely k-nearest Neighbor (k-NN) and Support Vector Machine (SVM), were used as quality raters. The proposed IBMOA and the original BMOA were compared on 21 multi-scale and multi-faceted benchmark datasets. The binary structures of eight contemporary algorithms, including Binary Artificial Bee Colony (BABC), Binary Grey Wolf Optimization (BGWO), Binary Sailfish Optimizer (BSFO), Binary Particle Swarm Optimizer (BPSO), Binary Bird Swarm Algorithm (BBSA), Binary Whale Optimization Algorithm (BWOA), Binary Grasshopper Optimization Algorithm (BGOA), and Binary Bat Algorithm (BBA), were also analyzed and compared. The proposed IBMOA algorithm outperforms competitors on small and large datasets, obtaining optimal solutions within a reasonable timeframe. This is true for the proposed IBMOA, which has been statistically proven to be highly competitive using the Wilcoxon rank sum test (with alpha=0.05).

Feature selection based on dataset variance optimization using Hybrid Sine Cosine – Firehawk Algorithm (HSCFHA)

Feature selection plays a pivotal role in preprocessing data for machine learning (ML) models. It entails choosing a subset of pertinent features to enhance the model’s accuracy and minimize overfitting. Wrapper methods based on metaheuristics are one approach to feature selection, leveraging the predictive accuracy of a learning algorithm to form a condensed set of features. Traditionally, this method uses K-Nearest Neighbor (KNN) for maximizing accuracy as its cost function. However, this approach often yields less than optimal results in large sample spaces and demands considerable computational resources. To circumvent the shortcomings of this approach, this work proposes a novel metaheuristic algorithm, termed the Hybrid Sine Cosine Firehawk Algorithm. Furthermore, a novel feature selection technique is designed that uses this hybrid algorithm to eliminate insignificant and redundant features by incorporating the minimization of dataset variance in the cost function. Additionally, the hybridization of multiple metaheuristic algorithms produces the best features of each algorithm to improve the exploration ability. The proposed technique is tested on 22 University of California Irvine datasets containing low, medium and high dimensional datasets and compared to the traditional KNN-based approach. The technique is also compared with other state-of-the-art metaheuristic techniques, namely Particle Swarm Optimizer, Grey Wolf Optimizer, Whale Optimization Algorithm, Hybrid Ant Colony Optimizer and Improved Binary Bat Algorithm. The results show significant improvements over previous techniques in terms of minimal loss in essential data while reducing the size of the raw data in considerably less time, as well as a well-balanced confusion matrix.

A binary bat algorithm with improved crossover operators and Cauchy mutation for unit commitment problem

A binary bat algorithm with improved crossover operators and Cauchy mutation for unit commitment problem

DETECTION OF KNEE OSTEOARTHRITIS BASED ON CENTER OF PRESSURE DATA AND THE BAT ALGORITHM

The high rate of knee osteoarthritis has raised the need for accurate diagnostic methods. In this study, we propose a precise detection method using the center of pressure data obtained from the patients. The introduced automatic detection pipeline is based on the two modern algorithms of grey wolf and BAT. The extracted statistical features and the obtained data from healthy individuals and patients are processed with the grey wolf binary algorithm. The results are fed into the binary bat algorithm to select important features and increase the pipeline accuracy. Then the groups are classified using a four-layer neural network. We show that the proposed method with a simple four-layer neural network offers fantastic accuracy in high-speed processing large data and classifies the high-dimensional knee osteoarthritis center of pressure data with appropriate precision, recall, specificity, and F1 values. The proposed method has direct applications in knee osteoarthritis diagnostics in clinics.

Global protein-protein interaction networks in yeast saccharomyces cerevisiae and helicobacter pylori

Understanding many biological processes relies heavily on accurately predicting protein-protein interactions (PPIs). In this study, we propose a novel method for predicting PPIs that is based on LogitBoost with a binary bat feature selection algorithm. Our approach involves the extraction of an initial feature vector by combining pseudo amino acid composition (PseAAC), pseudo-position-specific scoring matrix (PsePSSM), reduced sequence and index-vectors (RSIV), and autocorrelation descriptor (AD). Subsequently, a binary bat algorithm is applied to eliminate redundant features, and the resulting optimal features are fed into the LogitBoost classifier for the identification of PPIs. To evaluate the proposed method, we test it on two databases, Saccharomyces cerevisiae and Helicobacter pylori, using 10-fold cross-validation, and achieve accuracies of 94.39% and 97.89%, respectively. Our results showcase the significant potential of our pipeline in accurately predicting protein-protein interactions (PPIs), thereby offering a valuable resource to the scientific research community.

Binary bat algorithm based feature selection with deep reinforcement learning technique for intrusion detection system

Binary bat algorithm based feature selection with deep reinforcement learning technique for intrusion detection system

Effective Feature Selection Strategy for Supervised Classification based on an Improved Binary Aquila Optimization Algorithm

Feature Selection (FS) is considered a crucial step in machine learning and data mining tasks, which facilitates minimizing the direct consequence of redundant and irrelevant attributes on the model’s accuracy. Hence, the researchers developed various algorithms to choose the most appropriate features for improving the accuracy rate of the presented dataset. Nevertheless, these algorithms may fall into local optima problems when applied to substantial feature sizes’ datasets. In this paper, for handling the FS strategy through dimensionality-lessening while improving the classification accuracy, an effective Aquila Optimization (AO) algorithm is introduced. AO has stable exploration and exploitation capabilities. It is enhanced by integrating a random position amendment approach with Local Search (LS) strategy to avoid local optima and then cloned into a binary version called Improved Binary AO (IBAO). Additionally, k-Nearest Neighbor (k-NN) and Support Vector Machine (SVM) are quality estimators. On 18 multi-scale benchmarks, the IBAO algorithm is compared with the original BAO algorithm and twelve recent algorithms, such as Binary Artificial Bee Colony (BABC), Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO), Binary Whale Optimization Algorithm (BWOA), Binary Grey Wolf Optimization (BGWO), Binary Sailfish Optimizer (BSFO), Binary Henry Gas Solubility Optimization (BHGSO), Binary Harris Hawks Optimization (BHHO). According to Wilcoxon’s rank-sum test (α=0.05), the dominance and significant influence of IBAO are apparent on both small and large dimensional benchmarks and obtained classification accuracy up to 100% in some of these benchmarks integrated with a feature reduction size down to 92%.

Performance analysis of feature selection and classification in Big Data Information extraction

Purpose: Information extraction from big data is improved by either reducing the number of features in a data set or selecting features using intelligent data analysis. Generally, big data sets are complex to process using traditional approaches. Feature selection is highly essential in big data information extraction because it chooses the subset of features that influence the final classification. Reducing the number of selected features in the data leads to enhanced accuracy and efficiency of data extraction with other attributes used in the mathematical model. This work aims to improve the performance of the classifier using an enhanced binary bat algorithm-based effective feature selection model. formulated to enhance accuracy, efficiency of data extraction with other attributes. An enhanced binary bat algorithm (EBBA) proposed to solve the mentioned problem using local optimization and global optimization factor which improves the performance of optimization. Experiment carried out with different datasets selected to test effective performance of proposed algorithm and demonstrated performance is better with other algorithms. Design: The purpose of this paper is to provide, an effective feature selection model for big data information extraction. An enhanced binary bat algorithm has been proposed to improve attribute selection using local optimization and global optimization methods. Classification of multisource data using selected features using labeled approach. Particular Information extraction for multi view multi label (PIMM) approach is compared with EBBA algorithm. Further to enhance effectiveness of shared and specific information in big data [3] by setting the delta and omega factors in order to fuse different information from different view point, Online analysis of relevance with any redundancy analysis also been incorporated. Findings: All the experiments were carried out with different datasets on the number of iterations and fitness of the attributes to validate the effective performance of the proposed algorithm. Experimental results and graphs show that the proposed methodology improves the overall performance of optimization using PIMM models. Originality: A feature selection model based on the binary bat algorithm has been the focus of this paper. Subset selection and feature ranking are the two important methods used in this approach. Experiments were conducted on datasets to analyze the patterns in the number of iterations and fitness of the attributes over selection. The improvement in feature selection leads to better classification accuracy of the proposed model compared to other nature inspired techniques.

An effective beamformer for interference suppression without knowing the direction

<span>This paper proposes an effective beamformer for uniform linear arrays of half-wave dipole antennas based on binary bat algorithm (BBA) by controlling complex weights (both amplitudes and phases) excited at elements in an array. The proposed beamformer can impose adaptive nulls at interferences without knowing directions in the sidelobe region by minimizing the total output power of an array, whereas the main lobe and sidelobe levels are maintained. To demonstrate this capability, the proposal will be evaluated in several scenarios, compared to a beamformer based on binary particle swarm optimization (BPSO).</span>

Feature selection algorithm based on binary BAT algorithm and optimum path forest classifier for breast cancer detection using both echographic and elastographic mode ultrasound images.

Breast cancer is one of the fatal diseases among women. Every year, its incidence and mortality rate increase globally. Mammography and sonography are widely used in breast cancer detection. Because mammography misses many cancers and shows false negatives in the denser tissues, sonography is preferred to give some extra information in addition to that available from mammography. To improve the performance of breast cancer detection by reducing false positives. The local binary pattern (LBP) texture features must be extracted from ultrasound elastographic and echographic images of the same patients and then fused to form a single feature vector. Local Binary Pattern (LBP) texture features of elastographic and echographic images are extracted, and reduced individually through a hybrid feature selection technique based on binary BAT algorithm (BBA) and optimum path forest (OPF) classifier and then fused serially. Finally, the support vector machine classifier is used to classify the final fused feature set. Various relevant performance metrics such as accuracy, sensitivity, specificity, discriminant power, Mathews correlation coefficient (MCC), F1 score, and Kappa were used to analyze the classification results. The use of LBP feature produces 93.2% accuracy, 94.4% sensitivity, 92.3% specificity, 89.5% precision value, 91.88% F1 score, 93.34% balanced classification rate, and Mathews correlation coefficient of 0.861. The performance was compared with gray level co-occurrence matrix (GLCM), gray level difference matrix (GLDM), and LAWs features, and showed that LBP outperformed. Because the specificity is better, this method could be useful for detecting breast cancer with minimum false negatives.

Enhancing Quality of Service (QoS) and minimizing application placement delay in cloud-fog nodes through meta-heuristic algorithms

Efficient module placement in Cloud-Fog computing enhances QoS and minimizes delay. Binary Particle Swarm Optimization (BPSO) and Binary Bat Algorithm (BBA), effective meta-heuristic algorithms, address dynamic fog complexities. This study models placement as binary optimization, incorporating resource availability and latency. BPSO and BBA optimize module placement, demonstrated through simulations improving response time, throughput, and resource utilization. These meta-heuristic methods surpass traditional techniques, optimizing cloud-fog systems, achieving superior QoS, and reduced delay.

Optimal Fuzzy Logic Enabled Intrusion Detection for Secure IoT-Cloud燛nvironment

Recently, Internet of Things (IoT) devices have developed at a faster rate and utilization of devices gets considerably increased in day to day lives. Despite the benefits of IoT devices, security issues remain challenging owing to the fact that most devices do not include memory and computing resources essential for satisfactory security operation. Consequently, IoT devices are vulnerable to different kinds of attacks. A single attack on networking system/device could result in considerable data to data security and privacy. But the emergence of artificial intelligence (AI) techniques can be exploited for attack detection and classification in the IoT environment. In this view, this paper presents novel metaheuristics feature selection with fuzzy logic enabled intrusion detection system (MFSFL-IDS) in the IoT environment. The presented MFSFL-IDS approach purposes for recognizing the existence of intrusions and accomplish security in the IoT environment. To achieve this, the MFSFL-IDS model employs data pre-processing to transform the data into useful format. Besides, henry gas solubility optimization (HGSO) algorithm is applied as a feature selection approach to derive useful feature vectors. Moreover, adaptive neuro fuzzy inference system (ANFIS) technique was utilized for the recognition and classification of intrusions in the network. Finally, binary bat algorithm (BBA) is exploited for adjusting parameters involved in the ANFIS model. A comprehensive experimental validation of the MFSFL-IDS model is carried out using benchmark dataset and the outcomes are assessed under distinct aspects. The experimentation outcomes highlighted the superior performance of the MFSFL-IDS model over recent approaches with maximum accuracy of 99.80%.

An Efficient Beamformer for Interference Suppression Using Rectangular Antenna Arrays

Over the past ten years, the development of fifth-generation cellular network technology opens the door to the deployment of huge sensors inside the Internet of Things (IoT), challenging the technologies of communications. IoT establishes wireless communication between numerous physical things to connect them over the Internet, as a result, these things may seriously pollute the environment for electromagnetic propagation. This paper proposes an efficient beamformer based on binary bat algorithm for interference suppression in wireless technology applications. The proposed beamformer utilizes the technique of controlling only the phase of excitation weights in uniform rectangular arrays. This beamformer can produce optimal patterns with minimal distortions in sidelobe regions while maintaining the main lobe and placing nulls in the direction of interfering signals. To demonstrate this ability, the proposed beamformer is evaluated through several scenarios and compared to a beamformer based on Binary Particle Swarm Optimization (BPSO). The results show that the proposed beamformer maintains the main lobe toward the desired user direction while imposing nulls in unwanted user directions (interferences) and that it surpassed BPSO-based beamformers in terms of convergence speed and interference suppression ability.

Co-Operative Binary Bat Optimizer with Rough Set Reducts for Text Feature Selection

The process of eliminating irrelevant, redundant and noisy features while trying to maintain less information loss is known as a feature selection problem. Given the vast amount of the textual data generated and shared on the internet such as news reports, articles, tweets and product reviews, the need for an effective text-feature selection method becomes increasingly important. Recently, stochastic optimization algorithms have been adopted to tackle this problem. However, the efficiency of these methods is decreased when tackling high-dimensional problems. This decrease could be attributed to premature convergence where the population diversity is not well maintained. As an innovative attempt, a cooperative Binary Bat Algorithm (BBACO) is proposed in this work to select the optimal text feature subset for classification purposes. The proposed BBACO uses a new mechanism to control the population’s diversity during the optimization process and to improve the performance of BBA-based text-feature selection method. This is achieved by dividing the dimension of the problem into several parts and optimizing each of them in a separate sub-population. To evaluate the generality and capability of the proposed method, three classifiers and two standard benchmark datasets in English, two in Malay and one in Arabic were used. The results show that the proposed method steadily improves the classification performance in comparison with other well-known feature selection methods. The improvement is obtained for all of the English, Malay and Arabic datasets which indicates the generality of the proposed method in terms of the dataset language.