Hybrid Fruit-Fly Optimization Algorithm with K-Means for Text Document Clustering

IoT-based automated water pollution treatment using machine learning classifiers

Water is one of the most vital sources for the survival of life. In the globe, the accessibility of water in safe and healthy ways is a major concern. The consumption of unsafe water may lead to health risks. Therefore, it is necessary to classify and monitor the quality of water, but the main issue is that sufficient parametric quality measures are not available with advanced technology. To overcome the above issue, this paper presents an IoT-based automated water quality monitoring system using cloud and machine learning algorithms. It contains various sensor devices such as pH sensors, temperature sensors, turbidity sensors, and conductivity sensors. The classification of water quality in an accurate way is achieved by using the fusion of K-Nearest Neighbour (KNN) and Support Vector Machine (SVM). The sensor values are generated and transferred in the cloud server via Node MCU with low power wide area networks (LPWAN). This proposed work can replace the classification and monitoring of the traditional method to qualify the water status. It helps to save human beings from various infections and diseases caused by the unsafe usage of water. Water quality classification is very important to create an eco-friendly environment. This proposed machine learning algorithm KNN + SVM is tested by 10-fold cross-validation and the highest accuracy is 0.94, when compared with the existing algorithm.

A Novel Artificial Electric Field Algorithm for Solving Global Optimization and Real-World Engineering Problems

The Artificial Electric Field Algorithm (AEFA) stands out as a physics-inspired metaheuristic, drawing inspiration from Coulomb's law and electrostatic force; however, while AEFA has demonstrated efficacy, it can face challenges such as convergence issues and suboptimal solutions, especially in high-dimensional problems. To overcome these challenges, this paper introduces a modified version of AEFA, named mAEFA, which leverages the capabilities of Lévy flights, simulated annealing, and the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms. While Lévy flights enhance exploration potential and simulated annealing improves search exploitation, the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms are employed to add more diversity. The integration of these mechanisms in AEFA aims to expand its search space, enhance exploration potential, avoid local optima, and achieve improved performance, robustness, and a more equitable equilibrium between local intensification and global diversification. In this study, a comprehensive assessment of mAEFA is carried out, employing a combination of quantitative and qualitative measures, on a diverse range of 29 intricate CEC'17 constraint benchmarks that exhibit different characteristics. The practical compatibility of the proposed mAEFA is evaluated on five engineering benchmark problems derived from the civil, mechanical, and industrial engineering domains. Results from the mAEFA algorithm are compared with those from seven recently introduced metaheuristic algorithms using widely adopted statistical metrics. The mAEFA algorithm outperforms the LCA algorithm in all 29 CEC'17 test functions with 100% superiority and shows better results than SAO, GOA, CHIO, PSO, GSA, and AEFA in 96.6%, 96.6%, 93.1%, 86.2%, 82.8%, and 58.6% of test cases, respectively. In three out of five engineering design problems, mAEFA outperforms all the compared algorithms, securing second place in the remaining two problems. Results across all optimization problems highlight the effectiveness and robustness of mAEFA compared to baseline metaheuristics. The suggested enhancements in AEFA have proven effective, establishing competitiveness in diverse optimization problems.

Tuning attention based long-short term memory neural networks for Parkinson's disease detection using modified metaheuristics

Parkinson's disease (PD) is a progressively debilitating neurodegenerative disorder that primarily affects the dopaminergic system in the basal ganglia, impacting millions of individuals globally. The clinical manifestations of the disease include resting tremors, muscle rigidity, bradykinesia, and postural instability. Diagnosis relies mainly on clinical evaluation, lacking reliable diagnostic tests and being inherently imprecise and subjective. Early detection of PD is crucial for initiating treatments that, while unable to cure the chronic condition, can enhance the life quality of patients and alleviate symptoms. This study explores the potential of utilizing long-short term memory neural networks (LSTM) with attention mechanisms to detect Parkinson's disease based on dual-task walking test data. Given that the performance of networks is significantly inductance by architecture and training parameter choices, a modified version of the recently introduced crayfish optimization algorithm (COA) is proposed, specifically tailored to the requirements of this investigation. The proposed optimizer is assessed on a publicly accessible real-world clinical gait in Parkinson's disease dataset, and the results demonstrate its promise, achieving an accuracy of 87.4187 % for the best-constructed models.

Multi-population Black Hole Algorithm for the problem of data clustering

The retrieval of important information from a dataset requires applying a special data mining technique known as data clustering (DC). DC classifies similar objects into a groups of similar characteristics. Clustering involves grouping the data around k-cluster centres that typically are selected randomly. Recently, the issues behind DC have called for a search for an alternative solution. Recently, a nature-based optimization algorithm named Black Hole Algorithm (BHA) was developed to address the several well-known optimization problems. The BHA is a metaheuristic (population-based) that mimics the event around the natural phenomena of black holes, whereby an individual star represents the potential solutions revolving around the solution space. The original BHA algorithm showed better performance compared to other algorithms when applied to a benchmark dataset, despite its poor exploration capability. Hence, this paper presents a multi-population version of BHA as a generalization of the BHA called MBHA wherein the performance of the algorithm is not dependent on the best-found solution but a set of generated best solutions. The method formulated was subjected to testing using a set of nine widespread and popular benchmark test functions. The ensuing experimental outcomes indicated the highly precise results generated by the method compared to BHA and comparable algorithms in the study, as well as excellent robustness. Furthermore, the proposed MBHA achieved a high rate of convergence on six real datasets (collected from the UCL machine learning lab), making it suitable for DC problems. Lastly, the evaluations conclusively indicated the appropriateness of the proposed algorithm to resolve DC issues.

Tuning Machine Learning Models Using a Group Search Firefly Algorithm for Credit Card Fraud Detection

Recent advances in online payment technologies combined with the impact of the COVID-19 global pandemic has led to a significant escalation in the number of online transactions and credit card payments being executed every day. Naturally, there has also been an escalation in credit card frauds, which is having a significant impact on the banking institutions, corporations that issue credit cards, and finally, the vendors and merchants. Consequently, there is an urgent need to implement and establish proper mechanisms that can secure the integrity of online card transactions. The research presented in this paper proposes a hybrid machine learning and swarm metaheuristic approach to address the challenge of credit card fraud detection. The novel, enhanced firefly algorithm, named group search firefly algorithm, was devised and then used to a tune support vector machine, an extreme learning machine, and extreme gradient-boosting machine learning models. Boosted models were tested on the real-world credit card fraud detection dataset, gathered from the transactions of the European credit card users. The original dataset is highly imbalanced; to further analyze the performance of tuned machine learning models, in the second experiment performed for the purpose of this research, the dataset has been expanded by utilizing the synthetic minority over-sampling approach. The performance of the proposed group search firefly metaheuristic was compared with other recent state-of-the-art approaches. Standard machine learning performance indicators have been used for the evaluation, such as the accuracy of the classifier, recall, precision, and area under the curve. The experimental findings clearly demonstrate that the models tuned by the proposed algorithm obtained superior results in comparison to other models hybridized with competitor metaheuristics.

Multi-Swarm Algorithm for Extreme Learning Machine Optimization

There are many machine learning approaches available and commonly used today, however, the extreme learning machine is appraised as one of the fastest and, additionally, relatively efficient models. Its main benefit is that it is very fast, which makes it suitable for integration within products that require models taking rapid decisions. Nevertheless, despite their large potential, they have not yet been exploited enough, according to the recent literature. Extreme learning machines still face several challenges that need to be addressed. The most significant downside is that the performance of the model heavily depends on the allocated weights and biases within the hidden layer. Finding its appropriate values for practical tasks represents an NP-hard continuous optimization challenge. Research proposed in this study focuses on determining optimal or near optimal weights and biases in the hidden layer for specific tasks. To address this task, a multi-swarm hybrid optimization approach has been proposed, based on three swarm intelligence meta-heuristics, namely the artificial bee colony, the firefly algorithm and the sine-cosine algorithm. The proposed method has been thoroughly validated on seven well-known classification benchmark datasets, and obtained results are compared to other already existing similar cutting-edge approaches from the recent literature. The simulation results point out that the suggested multi-swarm technique is capable to obtain better generalization performance than the rest of the approaches included in the comparative analysis in terms of accuracy, precision, recall, and f1-score indicators. Moreover, to prove that combining two algorithms is not as effective as joining three approaches, additional hybrids generated by pairing, each, two methods employed in the proposed multi-swarm approach, were also implemented and validated against four challenging datasets. The findings from these experiments also prove superior performance of the proposed multi-swarm algorithm. Sample code from devised ELM tuning framework is available on the GitHub.

A Multi-Strategy Improved Arithmetic Optimization Algorithm

To improve the performance of the arithmetic optimization algorithm (AOA) and solve problems in the AOA, a novel improved AOA using a multi-strategy approach is proposed. Firstly, circle chaotic mapping is used to increase the diversity of the population. Secondly, a math optimizer accelerated (MOA) function optimized by means of a composite cycloid is proposed to improve the convergence speed of the algorithm. Meanwhile, the symmetry of the composite cycloid is used to balance the global search ability in the early and late iterations. Thirdly, an optimal mutation strategy combining the sparrow elite mutation approach and Cauchy disturbances is used to increase the ability of individuals to jump out of the local optimal. The Rastrigin function is selected as the reference test function to analyze the effectiveness of the improved strategy. Twenty benchmark test functions, algorithm time complexity, the Wilcoxon rank-sum test, and the CEC2019 test set are selected to test the overall performance of the improved algorithm, and the results are then compared with those of other algorithms. The test results show that the improved algorithm has obvious advantages in terms of both its global search ability and convergence speed. Finally, the improved algorithm is applied to an engineering example to further verify its practicability.

Novel hybrid firefly algorithm: an application to enhance XGBoost tuning for intrusion detection classification

The research proposed in this article presents a novel improved version of the widely adopted firefly algorithm and its application for tuning and optimising XGBoost classifier hyper-parameters for network intrusion detection. One of the greatest issues in the domain of network intrusion detection systems are relatively high false positives and false negatives rates. In the proposed study, by using XGBoost classifier optimised with improved firefly algorithm, this challenge is addressed. Based on the established practice from the modern literature, the proposed improved firefly algorithm was first validated on 28 well-known CEC2013 benchmark instances a comparative analysis with the original firefly algorithm and other state-of-the-art metaheuristics was conducted. Afterwards, the devised method was adopted and tested for XGBoost hyper-parameters optimisation and the tuned classifier was tested on the widely used benchmarking NSL-KDD dataset and more recent USNW-NB15 dataset for network intrusion detection. Obtained experimental results prove that the proposed metaheuristics has significant potential in tackling machine learning hyper-parameters optimisation challenge and that it can be used for improving classification accuracy and average precision of network intrusion detection systems.

Design of a Parallel Quadruped Robot Based on a Novel Intelligent Control System

In order to make a robot track a desired trajectory with high precision and steady gait, a novel intelligent controller was designed based on a new mechanical structure and optimized foot trajectory. Kinematics models in terms of the D-H method were established to analyze the relationship between the angle of the driving joint and the foot position. Inspired by a dog’s diagonal trot on a flat terrain, foot trajectory planning in the swing and support phases without impact were fulfilled based on the compound cycloid improved by the Bézier curve. Both the optimized cascade proportional–integral–derivative (PID) control system and improved fuzzy adaptive PID control system were applied to realize the stable operation of a quadruped robot, and their parameters were optimized by the sparrow search algorithm. The convergence speed and accuracy of the sparrow search algorithm were verified by comparing with the moth flame optimization algorithm and particle swarm optimization algorithm. Finally, a co-simulation with MATLAB and ADAMS was utilized to compare the effects of the two control systems. The results of both displacement and velocity exhibit that the movement of a quadruped bionic robot with fuzzy adaptive PID control systems optimized by the sparrow search algorithm possessed better accuracy and stability than cascade PID control systems. The motion process of the quadruped robot in the co-simulation process also demonstrates the effectiveness of the designed mechanical structure and control system.

Enhanced Brain Storm Optimization Algorithm Based on Modified Nelder–Mead and Elite Learning Mechanism

Brain storm optimization algorithm (BSO) is a popular swarm intelligence algorithm. A significant part of BSO is to divide the population into different clusters with the clustering strategy, and the blind disturbance operator is used to generate offspring. However, this mechanism is easy to lead to premature convergence due to lacking effective direction information. In this paper, an enhanced BSO algorithm based on modified Nelder–Mead and elite learning mechanism (BSONME) is proposed to improve the performance of BSO. In the proposed BSONEM algorithm, the modified Nelder–Mead method is used to explore the effective evolutionary direction. The elite learning mechanism is used to guide the population to exploit the promising region, and the reinitialization strategy is used to alleviate the population stagnation caused by individual homogenization. CEC2014 benchmark problems and two engineering management prediction problems are used to assess the performance of the proposed BSONEM algorithm. Experimental results and statistical analyses show that the proposed BSONEM algorithm is competitive compared with several popular improved BSO algorithms.

Comparative Evaluation of NLP-Based Approaches for Linking CAPEC Attack Patterns from CVE Vulnerability Information

Vulnerability and attack information must be collected to assess the severity of vulnerabilities and prioritize countermeasures against cyberattacks quickly and accurately. Common Vulnerabilities and Exposures is a dictionary that lists vulnerabilities and incidents, while Common Attack Pattern Enumeration and Classification is a dictionary of attack patterns. Direct identification of common attack pattern enumeration and classification from common vulnerabilities and exposures is difficult, as they are not always directly linked. Here, an approach to directly find common links between these dictionaries is proposed. Then, several patterns, which are combinations of similarity measures and popular algorithms such as term frequency–inverse document frequency, universal sentence encoder, and sentence BERT, are evaluated experimentally using the proposed approach. Specifically, two metrics, recall and mean reciprocal rank, are used to assess the traceability of the common attack pattern enumeration and classification identifiers associated with 61 identifiers for common vulnerabilities and exposures. The experiment confirms that the term frequency–inverse document frequency algorithm provides the best overall performance.

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.

Migration-Based Moth-Flame Optimization Algorithm

Moth–flame optimization (MFO) is a prominent swarm intelligence algorithm that demonstrates sufficient efficiency in tackling various optimization tasks. However, MFO cannot provide competitive results for complex optimization problems. The algorithm sinks into the local optimum due to the rapid dropping of population diversity and poor exploration. Hence, in this article, a migration-based moth–flame optimization (M-MFO) algorithm is proposed to address the mentioned issues. In M-MFO, the main focus is on improving the position of unlucky moths by migrating them stochastically in the early iterations using a random migration (RM) operator, maintaining the solution diversification by storing new qualified solutions separately in a guiding archive, and, finally, exploiting around the positions saved in the guiding archive using a guided migration (GM) operator. The dimensionally aware switch between these two operators guarantees the convergence of the population toward the promising zones. The proposed M-MFO was evaluated on the CEC 2018 benchmark suite on dimension 30 and compared against seven well-known variants of MFO, including LMFO, WCMFO, CMFO, CLSGMFO, LGCMFO, SMFO, and ODSFMFO. Then, the top four latest high-performing variants were considered for the main experiments with different dimensions, 30, 50, and 100. The experimental evaluations proved that the M-MFO provides sufficient exploration ability and population diversity maintenance by employing migration strategy and guiding archive. In addition, the statistical results analyzed by the Friedman test proved that the M-MFO demonstrates competitive performance compared to the contender algorithms used in the experiments.

A Digitalized Design Risk Analysis Tool with Machine-Learning Algorithm for EPC Contractor’s Technical Specifications Assessment on Bidding

Engineering, Procurement, and Construction (EPC) projects span the entire cycle of industrial plants, from bidding to engineering, construction, and start-up operation and maintenance. Most EPC contractors do not have systematic decision-making tools when bidding for the project; therefore, they rely on manual analysis and experience in evaluating the bidding contract documents, including technical specifications. Oftentimes, they miss or underestimate the presence of technical risk clauses or risk severity, potentially create with a low bid price and tight construction schedule, and eventually experience severe cost overrun or/and completion delays. Through this study, two digital modules, Technical Risk Extraction and Design Parameter Extraction, were developed to extract and analyze risks in the project’s technical specifications based on machine learning and AI algorithms. In the Technical Risk Extraction module, technical risk keywords in the bidding technical specifications are collected, lexiconized, and then extracted through phrase matcher technology, a machine learning natural language processing technique. The Design Parameter Extraction module compares the collected engineering standards’ so-called standard design parameters and the plant owner’s technical requirements on the bid so that a contractor’s engineers can detect the difference between them and negotiate them. As described above, through the two modules, the risk clauses of the technical specifications of the project are extracted, and the risks are detected and reconsidered in the bidding or execution of the project, thereby minimizing project risk and providing a theoretical foundation and system for contractors. As a result of the pilot test performed to verify the performance and validity of the two modules, the design risk extraction accuracy of the system module has a relative advantage of 50 percent or more, compared to the risk extraction accuracy of manual evaluation by engineers. In addition, the speed of the automatic extraction and analysis of the system modules are 80 times faster than the engineer’s manual analysis time, thereby minimizing project loss due to errors or omissions due to design risk analysis during the project bidding period with a set deadline.