Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/7573
Title: Neural Network training using genetic algorithm with a novel binary encoding
Authors: Liang, Yong 
Prof. LEUNG Kwong Sak 
Xu, Zong-Ben 
Issue Date: 2007
Publisher: Springer Verlag
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007, Vol. 4492 LNCS, Issue PART 2, Pages 371 - 380
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 
Abstract: Genetic algorithms (GAs) are widely used in the parameter training of Neural Network (NN). In this paper, we investigate GAs based on our proposed novel genetic representation to train the parameters of NN. A splicing/decomposable (S/D) binary encoding is designed based on some theoretical guidance and existing recommendations. Our theoretical and empirical investigations reveal that the S/D binary representation is more proper than other existing binary encodings for GAs' searching. Moreover, a new genotypic distance on the S/D binary space is equivalent to the Euclidean distance on the real-valued space during GAs convergence. Therefore, GAs can reliably and predictably solve problems of bounded complexity and the methods depended on the Euclidean distance for solving different kinds of optimization problems can be directly used on the S/D binary space. This investigation demonstrates that GAs based our proposed binary representation can efficiently and effectively train the parameters of NN. © Springer-Verlag Berlin Heidelberg 2007.
Type: Conference Paper
URI: http://hdl.handle.net/20.500.11861/7573
ISBN: 978-354072392-9
ISSN: 03029743
DOI: 10.1007/978-3-540-72393-6_45
Appears in Collections:Publication

Show full item record

SCOPUSTM   
Citations

1
checked on Jan 3, 2024

Page view(s)

12
checked on Jan 3, 2024

Google ScholarTM

Impact Indices

Altmetric

PlumX

Metrics


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.