Study on the Node Increasing Problem of Genetic Programming with Bounded Individual Size

Created by W.Langdon from gp-bibliography.bib Revision:1.8081

@InProceedings{Yang:2006:WCICA,

• author = "Zaiyue Yang and C. W. Chan",
• title = "Study on the Node Increasing Problem of Genetic Programming with Bounded Individual Size",
• booktitle = "The Sixth World Congress on Intelligent Control and Automation, WCICA 2006",
• year = "2006",
• pages = "3589--3593",
• address = "Dalian",
• publisher = "IEEE",
• keywords = "genetic algorithms, genetic programming, bloat",
• ISBN = "1-4244-0332-4",
• DOI = "doi:10.1109/WCICA.2006.1713038",
• 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",
• notes = "Dept. of Mech. Eng., Hong Kong Univ.",

}

Genetic Programming entries for Zaiyue Yang C W Chan

Citations