By Topic

Optimising neural network weights using genetic algorithms: a case study

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
$31 $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)
Lee, K.W. ; Dept. of Mech. Eng., Hong Kong Univ., Hong Kong ; Lam, H.N.

If has been demonstrated that genetic algorithms (GAs) can help search the global (or near global) optimum weights for neural networks of relatively small sizes. For larger networks, classical genetic algorithms cannot work effectively any more as too many parameters have to be optimised simultaneously. However, in this paper, if is shown that the combination of the techniques of hidden node redundancy elimination, hidden layer redundancy elimination and the use of adaptive probabilities of crossover and mutation can be used to find a satisfactory solution

Published in:

Neural Networks, 1995. Proceedings., IEEE International Conference on  (Volume:3 )

Date of Conference:

Nov/Dec 1995