Analysis of Variable Learning Rate Back Propagation with Cuckoo Search Algorithm for Data Classification

2021 ◽  
pp. 9-21
Author(s):  
Maria Ali ◽  
Abdullah Khan ◽  
Asfandyar Khan ◽  
Saima Anwar Lashari
Keyword(s):  
Search Algorithm ◽  
Back Propagation ◽  
Data Classification ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Learning Rate

scholarly journals Weight Optimization in Recurrent Neural Networks with Hybrid Metaheuristic Cuckoo Search Techniques for Data Classification

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Nazri Mohd Nawi ◽  
Abdullah Khan ◽  
M. Z. Rehman ◽  
Haruna Chiroma ◽  
Tutut Herawan
Keyword(s):  
Gradient Descent ◽  
Search Algorithm ◽  
Error Function ◽  
Back Propagation ◽  
Data Classification ◽  
Cuckoo Search ◽  
Recurrent Network ◽  
Training Algorithms ◽  
Local Minima ◽  
Classification Problems

Recurrent neural network (RNN) has been widely used as a tool in the data classification. This network can be educated with gradient descent back propagation. However, traditional training algorithms have some drawbacks such as slow speed of convergence being not definite to find the global minimum of the error function since gradient descent may get stuck in local minima. As a solution, nature inspired metaheuristic algorithms provide derivative-free solution to optimize complex problems. This paper proposes a new metaheuristic search algorithm called Cuckoo Search (CS) based on Cuckoo bird’s behavior to train Elman recurrent network (ERN) and back propagation Elman recurrent network (BPERN) in achieving fast convergence rate and to avoid local minima problem. The proposed CSERN and CSBPERN algorithms are compared with artificial bee colony using BP algorithm and other hybrid variants algorithms. Specifically, some selected benchmark classification problems are used. The simulation results show that the computational efficiency of ERN and BPERN training process is highly enhanced when coupled with the proposed hybrid method.

scholarly journals Novel Back Propagation Optimization by Cuckoo Search Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Jiao-hong Yi ◽  
Wei-hong Xu ◽  
Yuan-tao Chen
Keyword(s):  
Search Algorithm ◽  
Back Propagation ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Prediction Performance ◽  
General Regression Neural Network ◽  
Parameter Study ◽  
Local Minima ◽  
Bp Network ◽  
General Regression

The traditional Back Propagation (BP) has some significant disadvantages, such as training too slowly, easiness to fall into local minima, and sensitivity of the initial weights and bias. In order to overcome these shortcomings, an improved BP network that is optimized by Cuckoo Search (CS), called CSBP, is proposed in this paper. In CSBP, CS is used to simultaneously optimize the initial weights and bias of BP network. Wine data is adopted to study the prediction performance of CSBP, and the proposed method is compared with the basic BP and the General Regression Neural Network (GRNN). Moreover, the parameter study of CSBP is conducted in order to make the CSBP implement in the best way.

scholarly journals A Hybrid Forecasting Model Based on Empirical Mode Decomposition and the Cuckoo Search Algorithm: A Case Study for Power Load

2016 ◽  
Vol 2016 ◽  
pp. 1-28 ◽  
Author(s):  
Jiani Heng ◽  
Chen Wang ◽  
Xuejing Zhao ◽  
Jianzhou Wang
Keyword(s):  
Neural Network ◽  
Search Algorithm ◽  
Back Propagation ◽  
Cuckoo Search ◽  
Back Propagation Neural Network ◽  
Cuckoo Search Algorithm ◽  
Mode Decomposition ◽  
Power Load ◽  
Hybrid Forecasting

Power load forecasting always plays a considerable role in the management of a power system, as accurate forecasting provides a guarantee for the daily operation of the power grid. It has been widely demonstrated in forecasting that hybrid forecasts can improve forecast performance compared with individual forecasts. In this paper, a hybrid forecasting approach, comprising Empirical Mode Decomposition, CSA (Cuckoo Search Algorithm), and WNN (Wavelet Neural Network), is proposed. This approach constructs a more valid forecasting structure and more stable results than traditional ANN (Artificial Neural Network) models such as BPNN (Back Propagation Neural Network), GABPNN (Back Propagation Neural Network Optimized by Genetic Algorithm), and WNN. To evaluate the forecasting performance of the proposed model, a half-hourly power load in New South Wales of Australia is used as a case study in this paper. The experimental results demonstrate that the proposed hybrid model is not only simple but also able to satisfactorily approximate the actual power load and can be an effective tool in planning and dispatch for smart grids.

Optimal broadcast scheduling method for VANETs: An adaptive discrete firefly approach

2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho
Keyword(s):  
Intelligent Transportation System ◽  
Search Algorithm ◽  
Mac Protocol ◽  
High Mobility ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Traffic Density ◽  
Scheduling Problem ◽  
Broadcast Scheduling

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.

scholarly journals Optimization strategy of wireless charger node deployment based on improved cuckoo search algorithm

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yang Wang ◽  
Feifan Wang ◽  
Yujun Zhu ◽  
Yiyang Liu ◽  
Chuanxin Zhao
Keyword(s):  
Sensor Network ◽  
Sensor Node ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Sensor Nodes ◽  
Optimization Strategy ◽  
Multi Objective ◽  
Received Power

AbstractIn wireless rechargeable sensor network, the deployment of charger node directly affects the overall charging utility of sensor network. Aiming at this problem, this paper abstracts the charger deployment problem as a multi-objective optimization problem that maximizes the received power of sensor nodes and minimizes the number of charger nodes. First, a network model that maximizes the sensor node received power and minimizes the number of charger nodes is constructed. Second, an improved cuckoo search (ICS) algorithm is proposed. This algorithm is based on the traditional cuckoo search algorithm (CS) to redefine its step factor, and then use the mutation factor to change the nesting position of the host bird to update the bird’s nest position, and then use ICS to find the ones that maximize the received power of the sensor node and minimize the number of charger nodes optimal solution. Compared with the traditional cuckoo search algorithm and multi-objective particle swarm optimization algorithm, the simulation results show that the algorithm can effectively increase the receiving power of sensor nodes, reduce the number of charger nodes and find the optimal solution to meet the conditions, so as to maximize the network charging utility.

Sign in / Sign up

Export Citation Format

Share Document