29 research outputs found

    Brain image clustering by wavelet energy and CBSSO optimization algorithm

    Get PDF
    Previously, the diagnosis of brain abnormality was significantly important in the saving of social and hospital resources. Wavelet energy is known as an effective feature detection which has great efficiency in different utilities. This paper suggests a new method based on wavelet energy to automatically classify magnetic resonance imaging (MRI) brain images into two groups (normal and abnormal), utilizing support vector machine (SVM) classification based on chaotic binary shark smell optimization (CBSSO) to optimize the SVM weights. The results of the suggested CBSSO-based KSVM are compared favorably to several other methods in terms of better sensitivity and authenticity. The proposed CAD system can additionally be utilized to categorize the images with various pathological conditions, types, and illness modes

    Glowworm swarm optimisation for training multi-layer perceptrons

    Get PDF

    Fingerprint recognition based on shark smell optimization and genetic algorithm

    Get PDF
    Fingerprint recognition is a dominant form of biometric due to its distinctiveness. The study aims to extract and select the best features of fingerprint images, and evaluate the strength of the Shark Smell Optimization (SSO) and Genetic Algorithm (GA) in the search space with a chosen set of metrics. The proposed model consists of seven phases namely, enrollment, image preprocessing by using weighted median filter, feature extraction by using SSO, weight generation by using Chebyshev polynomial first kind (CPFK), feature selection by using GA, creation of a user’s database, and matching features by using Euclidean distance (ED). The effectiveness of the proposed model’s algorithms and performance is evaluated on 150 real fingerprint images that were collected from university students by the ZKTeco scanner at Sulaimani city, Iraq. The system’s performance was measured by three renowned error rate metrics, namely, False Acceptance Rate (FAR), False Rejection Rate (FRR), and Correct Verification Rate (CVR). The experimental outcome showed that the proposed fingerprint recognition model was exceedingly accurate recognition because of a low rate of both FAR and FRR, with a high CVR percentage gained which was 0.00, 0.00666, and 99.334%, respectively. This finding would be useful for improving biometric secure authentication based fingerprint. It is also possibly applied to other research topics such as fraud detection, e-payment, and other real-life applications authentication

    Implementing Flash Event Discrimination in IP Traceback using Shark Smell Optimisation Algorithm

    Get PDF
     Denial of service attack and its variants are the largest ravaging network problems. They are used to cause damage to network by disrupting its services in order to harm a business or organization. Flash event is a network phenomenon that causes surge in normal network flow due to sudden increase in number of network users, To curtail the menace of the Denial of service attack it is pertinent to expose the perpetrator and take appropriate action against it. Internet protocol traceback is a network forensic tool that is used to identify source of an Internet protocol packet. Most of presently available Internet protocol traceback tools that are based on bio-inspired algorithm employ flow-based search method for tracing source of a Denial of service attack without facility to differentiate flash event from the attack. Surge in network due to flash event can mislead such a traceback tool that uses flow-based search. This work present a solution that uses hop-by-hop search with an incorporated discrimination policy implemented by shark smell optimization algorithm to differentiate the attack traffic from other traffics. It was tested on performance and convergence against an existing bio-inspired traceback tool that uses flow-base method and yielded outstanding results in all the test

    Application of inclusive multiple model for the prediction of saffron water footprint

    Get PDF
    Applying new approaches in the management of water resources is a vital issue, especially in arid and semi-arid regions. The water footprint is a key index in water management. Therefore, it is necessary to predict its changes for future durations. The soft computing model is one of the most widely used models in predicting and estimating agroclimatic variables. The purpose of this study is to predict the green and blue water footprints of saffron product using the soft computing model. In order to select the most effective variables in prediction water footprints, the individual input was eliminated one by one and the effect of each on the residual mean square error (RMSE) was measured. In the first stage, the Group Method of Data Handling (GMDH) and evolutionary algorithms have been applied. In the next stage, the output of individual models was incorporated into the Inclusive Multiple Model (IMM) as the input variables in order to predict the blue and green water footprints of saffron product in three homogenous agroclimatic regions. Finally, the uncertainty of the model caused by the input and parameters was evaluated. The contributions of this research are introducing optimized GMDH and new ensemble models for predicting BWF, and GWF, uncertainty analysis and investigating effective inputs on the GWF and BWF. The results indicated that the most important variables affecting green and blue water footprints are plant transpiration, evapotranspiration, and yield, since removing these variables significantly increased the RMSE (range=11–25). Among the GMDH models, the best performance belonged to NMRA (Naked Mole Ranked Algorithm) due to the fast convergence and high accuracy of the outputs. In this regard, the IMM has a better performance (FSD=0.76, NSE=0.95, MAE) = 8, PBIAS= 8) than the alternatives due to applying the outputs of several individual models and the lowest uncertainty based on the parameters and inputs of the model (p = 0.98, r = 0.08)

    Tree Growth Algorithm for Parameter Identification of Proton Exchange Membrane Fuel Cell Models

    Get PDF
    Demonstrating an accurate mathematical model is a mandatory issue for realistic simulation, optimization and performance evaluation of proton exchange membrane fuel cells (PEMFCs). The main goal of this study is to demonstrate a precise mathematical model of PEMFCs through estimating the optimal values of the unknown parameters of these cells. In this paper, an efficient optimization technique, namely, Tree Growth Algorithm (TGA) is applied for extracting the optimal parameters of different PEMFC stacks. The total of the squared deviations (TSD) between the experimentally measured data and the estimated ones is adopted as the objective function. The effectiveness of the developed parameter identification algorithm is validated through four case studies of commercial PEMFC stacks under various operating conditions. Moreover, comprehensive comparisons with other optimization algorithms under the same study cases are demonstrated. Statistical analysis is presented to evaluate the accuracy and reliability of the developed algorithm in solving the studied optimization problem

    A novel optimized deep learning method for protein-protein prediction in bioinformatics

    Get PDF
    Proteins have been shown to perform critical activities in cellular processes and are required for the organism's existence and proliferation. On complicated protein-protein interaction (PPI) networks, conventional centrality approaches perform poorly. Machine learning algorithms based on enormous amounts of data do not make use of biological information's temporal and spatial dimensions. As a result, we developed a sequence-dependent PPI prediction model using an Aquila and shark noses-based hybrid prediction technique. This model operates in two stages: feature extraction and prediction. The features are acquired using the semantic similarity technique for good results. The acquired features are utilized to predict the PPI using hybrid deep networks long short-term memory (LSTM) networks and restricted Boltzmann machines (RBMs). The weighting parameters of these neural networks (NNs) were changed using a novel optimization approach hybrid of aquila and shark noses (ASN), and the results revealed that our proposed ASN-based PPI prediction is more accurate and efficient than other existing techniques

    An innovative metaheuristic strategy for solar energy management through a neural networks framework

    Get PDF
    Proper management of solar energy as an effective renewable source is of high importance toward sustainable energy harvesting. This paper offers a novel sophisticated method for predicting solar irradiance (SIr) from environmental conditions. To this end, an efficient metaheuristic technique, namely electromagnetic field optimization (EFO), is employed for optimizing a neural network. This algorithm quickly mines a publicly available dataset for nonlinearly tuning the network parameters. To suggest an optimal configuration, five influential parameters of the EFO are optimized by an extensive trial and error practice. Analyzing the results showed that the proposed model can learn the SIr pattern and predict it for unseen conditions with high accuracy. Furthermore, it provided about 10% and 16% higher accuracy compared to two benchmark optimizers, namely shuffled complex evolution and shuffled frog leaping algorithm. Hence, the EFO-supervised neural network can be a promising tool for the early prediction of SIr in practice. The findings of this research may shed light on the use of advanced intelligent models for efficient energy development

    Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration versus Algorithmic Behavior, Critical Analysis and Recommendations

    Full text link
    In recent years, a great variety of nature- and bio-inspired algorithms has been reported in the literature. This algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature-inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper. From our analysis we conclude that a poor relationship is often found between the natural inspiration of an algorithm and its behavior. Furthermore, similarities in terms of behavior between different algorithms are greater than what is claimed in their public disclosure: specifically, we show that more than one-third of the reviewed bio-inspired solvers are versions of classical algorithms. Grounded on the conclusions of our critical analysis, we give several recommendations and points of improvement for better methodological practices in this active and growing research field.Comment: 76 pages, 6 figure

    An efficient parameter estimation algorithm for proton exchange membrane fuel cells

    Get PDF
    The proton exchange membrane fuel cell (PEMFC) is a favorable renewable energy source to overcome environmental pollution and save electricity. However, the mathematical model of the PEMFC contains some unknown parameters which have to be accurately estimated to build an accurate PEMFC model; this problem is known as the parameter estimation of PEMFC and belongs to the optimization problem. Although this problem belongs to the optimization problem, not all optimization algorithms are suitable to solve it because it is a nonlinear and complex problem. Therefore, in this paper, a new optimization algorithm known as the artificial gorilla troops optimizer (GTO), which simulates the collective intelligence of gorilla troops in nature, is adapted for estimating this problem. However, the GTO is suffering from local optima and low convergence speed problems, so a modification based on replacing its exploitation operator with a new one, relating the exploration and exploitation according to the population diversity in the current iteration, has been performed to improve the exploitation operator in addition to the exploration one. This modified variant, named the modified GTO (MGTO), has been applied for estimating the unknown parameters of three PEMFC stacks, 250 W stack, BCS-500W stack, and SR-12 stack, used widely in the literature, based on minimizing the error between the measured and estimated data points as the objective function. The outcomes obtained by applying the GTO and MGTO on those PEMFC stacks have been extensively compared with those of eight well-known optimization algorithms using various performance analyses, best, average, worst, standard deviation (SD), CPU time, mean absolute percentage error (MAPE), and mean absolute error (MAE), in addition to the Wilcoxon rank-sum test, to show which one is the best for solving this problem. The experimental findings show that MGTO is the best for all performance metrics, but CPU time is competitive among all algorithms
    corecore