3,167 research outputs found
Metaheuristic design of feedforward neural networks: a review of two decades of research
Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era
Bat Algorithm: Literature Review and Applications
Bat algorithm (BA) is a bio-inspired algorithm developed by Yang in 2010 and
BA has been found to be very efficient. As a result, the literature has
expanded significantly in the last 3 years. This paper provides a timely review
of the bat algorithm and its new variants. A wide range of diverse applications
and case studies are also reviewed and summarized briefly here. Further
research topics are also discussed.Comment: 10 page
Victoria Amazonica Optimization (VAO): An Algorithm Inspired by the Giant Water Lily Plant
The Victoria Amazonica plant, often known as the Giant Water Lily, has the
largest floating spherical leaf in the world, with a maximum leaf diameter of 3
meters. It spreads its leaves by the force of its spines and creates a large
shadow underneath, killing any plants that require sunlight. These water
tyrants use their formidable spines to compel each other to the surface and
increase their strength to grab more space from the surface. As they spread
throughout the pond or basin, with the earliest-growing leaves having more room
to grow, each leaf gains a unique size. Its flowers are transsexual and when
they bloom, Cyclocephala beetles are responsible for the pollination process,
being attracted to the scent of the female flower. After entering the flower,
the beetle becomes covered with pollen and transfers it to another flower for
fertilization. After the beetle leaves, the flower turns into a male and
changes color from white to pink. The male flower dies and sinks into the
water, releasing its seed to help create a new generation. In this paper, the
mathematical life cycle of this magnificent plant is introduced, and each leaf
and blossom are treated as a single entity. The proposed bio-inspired algorithm
is tested with 24 benchmark optimization test functions, such as Ackley, and
compared to ten other famous algorithms, including the Genetic Algorithm. The
proposed algorithm is tested on 10 optimization problems: Minimum Spanning
Tree, Hub Location Allocation, Quadratic Assignment, Clustering, Feature
Selection, Regression, Economic Dispatching, Parallel Machine Scheduling, Color
Quantization, and Image Segmentation and compared to traditional and
bio-inspired algorithms. Overall, the performance of the algorithm in all tasks
is satisfactory.Comment: 45 page
Designing a fruit identification algorithm in orchard conditions to develop robots using video processing and majority voting based on hybrid artificial neural network
The first step in identifying fruits on trees is to develop garden robots for different purposes
such as fruit harvesting and spatial specific spraying. Due to the natural conditions of the fruit
orchards and the unevenness of the various objects throughout it, usage of the controlled conditions
is very difficult. As a result, these operations should be performed in natural conditions, both
in light and in the background. Due to the dependency of other garden robot operations on the
fruit identification stage, this step must be performed precisely. Therefore, the purpose of this
paper was to design an identification algorithm in orchard conditions using a combination of video
processing and majority voting based on different hybrid artificial neural networks. The different
steps of designing this algorithm were: (1) Recording video of different plum orchards at different
light intensities; (2) converting the videos produced into its frames; (3) extracting different color
properties from pixels; (4) selecting effective properties from color extraction properties using
hybrid artificial neural network-harmony search (ANN-HS); and (5) classification using majority
voting based on three classifiers of artificial neural network-bees algorithm (ANN-BA), artificial
neural network-biogeography-based optimization (ANN-BBO), and artificial neural network-firefly
algorithm (ANN-FA). Most effective features selected by the hybrid ANN-HS consisted of the third
channel in hue saturation lightness (HSL) color space, the second channel in lightness chroma hue
(LCH) color space, the first channel in L*a*b* color space, and the first channel in hue saturation
intensity (HSI). The results showed that the accuracy of the majority voting method in the best execution
and in 500 executions was 98.01% and 97.20%, respectively. Based on different performance evaluation
criteria of the classifiers, it was found that the majority voting method had a higher performance.European Union (EU) under Erasmus+ project entitled
“Fostering Internationalization in Agricultural Engineering in Iran and Russia” [FARmER] with grant
number 585596-EPP-1-2017-1-DE-EPPKA2-CBHE-JPinfo:eu-repo/semantics/publishedVersio
Software Fault Prediction using Bio-Inspired Algorithms to Select the Features to be employed: An Empirical Study
In recent past, the use of bio-inspired algorithms got a significant attention in software fault predictions, where they can be used to select the most relevant features for a dataset aiming to increase the prediction accuracy of estimation techniques. The most-earlier and widely investigated algorithms are Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). More recently, researchers have analyzed other algorithms inspired from nature. In this paper, we consider GA and PSO as baseline/benchmark algorithms and evaluate their performances against seven recently-employed bio-inspired algorithms and metaheuristics, namely Ant Colony Optimization, Bat Search, Bee Search, Cuckoo Search, Harmony Search, Multi-Objective Evolutionary Algorithm, and Tabu Search, for feature selection in software fault prediction. We present experiments with seven open source datasets and three estimation techniques: Random Forest, Support Vector Regression, and Linear Regression. We found that it is not always true that the recently introduced algorithms outperform the earlier introduced algorithms
Current Studies and Applications of Krill Herd and Gravitational Search Algorithms in Healthcare
Nature-Inspired Computing or NIC for short is a relatively young field that
tries to discover fresh methods of computing by researching how natural
phenomena function to find solutions to complicated issues in many contexts. As
a consequence of this, ground-breaking research has been conducted in a variety
of domains, including synthetic immune functions, neural networks, the
intelligence of swarm, as well as computing of evolutionary. In the domains of
biology, physics, engineering, economics, and management, NIC techniques are
used. In real-world classification, optimization, forecasting, and clustering,
as well as engineering and science issues, meta-heuristics algorithms are
successful, efficient, and resilient. There are two active NIC patterns: the
gravitational search algorithm and the Krill herd algorithm. The study on using
the Krill Herd Algorithm (KH) and the Gravitational Search Algorithm (GSA) in
medicine and healthcare is given a worldwide and historical review in this
publication. Comprehensive surveys have been conducted on some other
nature-inspired algorithms, including KH and GSA. The various versions of the
KH and GSA algorithms and their applications in healthcare are thoroughly
reviewed in the present article. Nonetheless, no survey research on KH and GSA
in the healthcare field has been undertaken. As a result, this work conducts a
thorough review of KH and GSA to assist researchers in using them in diverse
domains or hybridizing them with other popular algorithms. It also provides an
in-depth examination of the KH and GSA in terms of application, modification,
and hybridization. It is important to note that the goal of the study is to
offer a viewpoint on GSA with KH, particularly for academics interested in
investigating the capabilities and performance of the algorithm in the
healthcare and medical domains.Comment: 35 page
Hybridizing Cartesian Genetic Programming and Harmony Search for Adaptive Feature Construction in Supervised Learning Problems
The advent of the so-called Big Data paradigm has motivated a flurry of research aimed at enhancing machine learning models by following very di- verse approaches. In this context this work focuses on the automatic con- struction of features in supervised learning problems, which differs from the conventional selection of features in that new characteristics with enhanced predictive power are inferred from the original dataset. In particular this manuscript proposes a new iterative feature construction approach based on a self-learning meta-heuristic algorithm (Harmony Search) and a solution encoding strategy (correspondingly, Cartesian Genetic Programming) suited to represent combinations of features by means of constant-length solution vectors. The proposed feature construction algorithm, coined as Adaptive Cartesian Harmony Search (ACHS), incorporates modifications that allow exploiting the estimated predictive importance of intermediate solutions and, ultimately, attaining better convergence rate in its iterative learning proce- dure. The performance of the proposed ACHS scheme is assessed and com- pared to that rendered by the state of the art in a toy example and three practical use cases from the literature. The excellent performance figures obtained in these problems shed light on the widespread applicability of the proposed scheme to supervised learning with legacy datasets composed by already refined characteristics
A Survey on Natural Inspired Computing (NIC): Algorithms and Challenges
Nature employs interactive images to incorporate end users2019; awareness and implication aptitude form inspirations into statistical/algorithmic information investigation procedures. Nature-inspired Computing (NIC) is an energetic research exploration field that has appliances in various areas, like as optimization, computational intelligence, evolutionary computation, multi-objective optimization, data mining, resource management, robotics, transportation and vehicle routing. The promising playing field of NIC focal point on managing substantial, assorted and self-motivated dimensions of information all the way through the incorporation of individual opinion by means of inspiration as well as communication methods in the study practices. In addition, it is the permutation of correlated study parts together with Bio-inspired computing, Artificial Intelligence and Machine learning that revolves efficient diagnostics interested in a competent pasture of study. This article intend at given that a summary of Nature-inspired Computing, its capacity and concepts and particulars the most significant scientific study algorithms in the field
EEG-based person identification through binary flower pollination algorithm
Electroencephalogram (EEG) signal presents a great potential for highly secure biometric systems due to its characteristics of universality, uniqueness, and natural robustness to spoofing attacks. EEG signals are measured by sensors placed in various positions of a person’s head (channels). In this work, we address the problem of reducing the number of required sensors while maintaining a comparable performance. We evaluated a binary version of the Flower Pollination Algorithm under different transfer functions to select the best subset of channels that maximizes the accuracy, which is measured by means of the Optimum-Path Forest classifier. The experimental results show the proposed approach can make use of less than a half of the number of sensors while maintaining recognition rates up to 87%, which is crucial towards the effective use of EEG in biometric applications
- …