Search

Feature selection is an important component of the machine learning domain, which selects the ideal subset of characteristics relative to the target data by omitting irrelevant data. For a given number of features, there are 2n possible feature subsets, making it challenging to select the optimal set of features from a dataset via conventional feature selection approaches. We opted to investigate glaucoma infection since the number of individuals with this disease is rising quickly around the world. The goal of this study is to use the feature set (features derived from fundus images of benchmark datasets) to classify images into two classes (infected and normal) and to select the fewest features (feature selection) to achieve the best performance on various efficiency measuring metrics. In light of this, the paper implements and recommends a metaheuristics-based technique for feature selection based on emperor penguin optimization, bacterial foraging optimization, and proposes their hybrid algorithm. From the retinal fundus benchmark images, a total of 36 features were extracted. The proposed technique for selecting features minimizes the number of features while improving classification accuracy. Six machine learning classifiers classify on the basis of a smaller subset of features provided by these three optimization techniques. In addition to the execution time, eight statistically based performance metrics are calculated. The hybrid optimization technique combined with random forest achieves the highest accuracy, up to 0.95410. Because the proposed medical decision support system is effective and ensures trustworthy decision-making for glaucoma screening, it might be utilized by medical practitioners as a second opinion tool, as well as assist overworked expert ophthalmologists and prevent individuals from losing their eyesight. [ABSTRACT FROM AUTHOR]

In this paper, a smart home energy management system is proposed to improve the efficiency of the electricity infrastructure of residential buildings. To solve the scheduling problem of a smart building, we propose bacterial foraging ant colony optimization (HB-ACO). The primary objective of scheduling is to shift load from on-peak hours to off-peak hours to reduce electricity cost and peak-to-average ratio. A comparison of these algorithms is also presented in terms of performance parameters, electricity cost, reduction of PAR, and user comfort in terms of waiting time. The proposed techniques are evaluated using two pricing schemes: (1) time of use and (2) critical peak pricing. Moreover, coordination among home appliances is presented for real-time scheduling. We represent this as a knapsack problem and solve it through ant colony optimization algorithm. The HB-ACO shows better performance than ACO and BFA in reducing electricity cost, PAR, and increased user comfort, which is evident from the simulation results. [ABSTRACT FROM AUTHOR]

Bacterial foraging optimization (BFO) has been proved to be an efficient optimization method and successfully applied to a variety of fields in the real world. In BFO, the chemotaxis process is a complex and close combination of swimming and tumbling and plays a crucial role in searching better solutions. A previous study has modeled the dynamics of the chemotaxis mechanism mathematically and investigated the stability and convergence behavior of the chemotaxis dynamics over the one-dimensional objective function by Lyapunov stability theorem. However, this study appears to be very limited from a practical point of view, and how to extend their study to the multi-dimensional objective function is a challenge. To solve it, we present a stability analysis of chemotaxis dynamics in BFO over the multi-dimensional objective function in this paper. First, the general mathematical model of the chemotaxis mechanism over the multi-dimensional objective function is created. Secondly, this paper uses the general descent search to analyze the general mathematical model and points out two necessary conditions for avoiding the bacterium to trap into a non-optimal solution. And then, the stability and convergence of the chemotaxis dynamics, represented by the general mathematical model, are proved by using Lyapunov stability theorem. Finally, empirical research is conducted to validate the above theoretical analysis. [ABSTRACT FROM AUTHOR]

Identifying functional modules in PPI networks contributes greatly to the understanding of cellular functions and mechanisms. Recently, the swarm intelligence-based approaches have become effective ways for detecting functional modules in PPI networks. This paper presents a new computational approach based on bacterial foraging optimization for functional module detection in PPI networks (called BFO-FMD). In BFO-FMD, each bacterium represents a candidate module partition encoded as a directed graph, which is first initialized by a random-walk behavior according to the topological and functional information between protein nodes. Then, BFO-FMD utilizes four principal biological mechanisms, chemotaxis, conjugation, reproduction, and elimination and dispersal to search for better protein module partitions. To verify the performance of BFO-FMD, we compared it with several other typical methods on three common yeast datasets. The experimental results demonstrate the excellent performances of BFO-FMD in terms of various evaluation metrics. BFO-FMD achieves outstanding Recall, F-measure, and PPV while performing very well in terms of other metrics. Thus, it can accurately predict protein modules and help biologists to find some novel biological insights. [ABSTRACT FROM AUTHOR]

A Bayesian network (BN) is an important probabilistic model in the field of artificial intelligence and a powerful formalism used to describe uncertainty in the real world. As science and technology develop, considerable data on complex systems have been acquired by various means, which presents a significant challenge regarding how to accurately and robustly learn a network structure for a complex system. To address this challenge, many BN structure learning methods based on swarm intelligence have been developed. In this study, we perform a systematic comparison of three typical methods based on ant colony optimization, artificial bee colony algorithm, and bacterial foraging optimization. First, we analyze and summarize their main characteristics from the perspective of stochastic searching. Second, we conduct thorough experimental comparisons to examine the roles of different mechanisms in each method by means of multiaspect metrics, i.e., the K2 score, structural differences, and execution time. Next, we perform further experiments to validate the robustness of different algorithms on some benchmark data sets with noise. Finally, we present the prospects and references for researchers who are engaged in learning BN networks. [ABSTRACT FROM AUTHOR]