By Topic

Hierarchical rank density genetic algorithm for radial-basis function neural network design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. G. Yen ; Sch. of Electr. & Comput. Eng., Oklahoma State Univ., Stillwater, OK, USA ; Haiming Lu

In this paper, we propose a genetic algorithm based design procedure for a radial-basis function neural network. A hierarchical rank density genetic algorithm (HRDGA) is used to evolve both the neural network's topology and parameters. In addition, the rank-density based fitness assignment technique is used to optimize the performance and topology of the evolved neural network to deal with the confliction between the training performance and network complexity. Instead of producing a single optimal network, HRDGA provides a set of near-optimal neural networks to the designers or the decision makers so that they can have more flexibility for the final decision-making based on their preferences. In terms of searching for a near-complete set of candidate networks with high performances, the networks designed by the proposed algorithm prove to be competitive, or even superior, to three selected traditional radial-basis function networks for predicting Mackey-Glass chaotic time series

Published in:

Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on  (Volume:1 )

Date of Conference:

12-17 May 2002