DocumentCode :
1752896
Title :
Study on the Node Increasing Problem of Genetic Programming with Bounded Individual Size
Author :
Yang, Zaiyue ; Chan, C.W.
Author_Institution :
Dept. of Mech. Eng., Hong Kong Univ.
Volume :
1
fYear :
0
fDate :
0-0 0
Firstpage :
3589
Lastpage :
3593
Abstract :
Firstly, a new conception of node saturation is defined. Then through theoretic analysis, it is proposed that the node saturation can be reflected by the average fitness if with bounded individual size and the same population size and individual upper boundary. Finally through a series of experiments, this announcement is been validated
Keywords :
genetic algorithms; average fitness; bounded individual size; genetic programming; node increasing problem; node saturation; Automation; Electronic mail; Genetic algorithms; Genetic programming; IEEE news; Intelligent control; Mechanical engineering; Genetic programming; Intron; Node; Node saturation; Symbol regression;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on
Conference_Location :
Dalian
Print_ISBN :
1-4244-0332-4
Type :
conf
DOI :
10.1109/WCICA.2006.1713038
Filename :
1713038
Link To Document :
بازگشت