scholarly journals Taking advantage of hybrid bioinspired intelligent algorithm with decoupled extended Kalman filter for optimizing growing and pruning radial basis function network

2018 ◽  
Vol 5 (9) ◽  
pp. 180529
Author(s):  
Zhilei Chai ◽  
Wei Song ◽  
Qinxin Bao ◽  
Feng Ding ◽  
Fei Liu

The growing and pruning radial basis function (GAP-RBF) network is a promising sequential learning algorithm for prediction analysis, but the parameter selection of such a network is usually a non-convex problem and makes it difficult to handle. In this paper, a hybrid bioinspired intelligent algorithm is proposed to optimize GAP-RBF. Specifically, the excellent local convergence of particle swarm optimization (PSO) and the extensive search ability of genetic algorithm (GA) are both considered to optimize the weights and bias term of GAP-RBF. Meanwhile, a competitive mechanism is proposed to make the hybrid algorithm choose the appropriate individuals for effective search and further improve its optimization ability. Moreover, a decoupled extended Kalman filter (DEKF) method is introduced in this study to reduce the size of error covariance matrix and decrease the computational complexity for performing real-time predictions. In the experiments, three classic forecasting issues including abalone age, Boston house price and auto MPG are adopted for extensive test, and the experimental results show that our method performs better than PSO and GA these two single bioinspired optimization algorithms. What is more, our method via DEKF achieves the better results in comparison with the state-of-art sequential learning algorithms, such as GAP-RBF, minimal resource allocation network, resource allocation network using an extended Kalman filter and resource allocation network.

2014 ◽  
Vol 989-994 ◽  
pp. 2705-2708
Author(s):  
Xu Sheng Gan ◽  
Hai Long Gao

To improve the learning capability of Radial Basis Function (RBF) neural network, a RBF neural network algorithm based on Extended Kalman Filter (EKF) is proposed. First the basic idea of EKF algorithm and RBF neural network are introduced, and then EKF is used to optimize the parameters combination of RBF neural network to obtain the better model. The experiment proves its feasibility.


2012 ◽  
Vol 11 (04) ◽  
pp. 749-775 ◽  
Author(s):  
ACHRAF JABEUR TELMOUDI ◽  
HATEM TLIJANI ◽  
LOTFI NABLI ◽  
MAARUF ALI ◽  
RADHI M'HIRI

A novel neural architecture for prediction in industrial control: the 'Double Recurrent Radial Basis Function network' (R2RBF) is introduced for dynamic monitoring and prognosis of industrial processes. Three applications of the R2RBF network on the prediction values confirmed that the proposed architecture minimizes the prediction error. The proposed R2RBF is excited by the recurrence of the output looped neurons on the input layer which produces a dynamic memory on both the input and output layers. Given the learning complexity of neural networks with the use of the back-propagation training method, a simple architecture is proposed consisting of two simple Recurrent Radial Basis Function networks (RRBF). Each RRBF only has the input layer with looped neurons using the sigmoid activation function. The output of the first RRBF also presents an additional input for the second RRBF. An unsupervised learning algorithm is proposed to determine the parameters of the Radial Basis Function (RBF) nodes. The K-means unsupervised learning algorithm used for the hidden layer is enhanced by the initialization of these input parameters by the output parameters of the RCE algorithm.


2009 ◽  
Vol 19 (04) ◽  
pp. 253-267 ◽  
Author(s):  
R. SAVITHA ◽  
S. SURESH ◽  
N. SUNDARARAJAN

In this paper, a fully complex-valued radial basis function (FC-RBF) network with a fully complex-valued activation function has been proposed, and its complex-valued gradient descent learning algorithm has been developed. The fully complex activation function, sech(.) of the proposed network, satisfies all the properties needed for a complex-valued activation function and has Gaussian-like characteristics. It maps Cn → C, unlike the existing activation functions of complex-valued RBF network that maps Cn → R. Since the performance of the complex-RBF network depends on the number of neurons and initialization of network parameters, we propose a K-means clustering based neuron selection and center initialization scheme. First, we present a study on convergence using complex XOR problem. Next, we present a synthetic function approximation problem and the two-spiral classification problem. Finally, we present the results for two practical applications, viz., a non-minimum phase equalization and an adaptive beam-forming problem. The performance of the network was compared with other well-known complex-valued RBF networks available in literature, viz., split-complex CRBF, CMRAN and the CELM. The results indicate that the proposed fully complex-valued network has better convergence, approximation and classification ability.


Sign in / Sign up

Export Citation Format

Share Document