Building Optimal Committees of Genetic Programs

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

@InProceedings{Zhang-JoungPPSN2000,

• author = "Byoung-Tak Zhang and Je-Gun Joung",
• title = "Building Optimal Committees of Genetic Programs",
• booktitle = "Parallel Problem Solving from Nature - PPSN VI 6th International Conference",
• editor = "Marc Schoenauer and Kalyanmoy Deb and G{\"u}nter Rudolph and Xin Yao and Evelyne Lutton and Juan Julian Merelo and Hans-Paul Schwefel",
• year = "2000",
• publisher = "Springer Verlag",
• address = "Paris, France",
• month = "16-20 " # sep,
• volume = "1917",
• series = "LNCS",
• pages = "231--240",
• isbn13 = "978-3-540-41056-0",
• DOI = "doi:10.1007/3-540-45356-3_23",
• keywords = "genetic algorithms, genetic programming",
• size = "10 pages",
• abstract = "Committee machines are known to improve the performance of individual learners. Evolutionary algorithms generate multiple individuals that can be combined to build committee machines. However, it is not easy to decide how big the committee should be and what members constitute the best committee. In this paper, we present a probabilistic search method for determining the size and members of the committees of individuals that are evolved by a standard GP engine. Applied to a suite of benchmark learning tasks, the GP committees achieved significant improvement in prediction accuracy.",

}

Genetic Programming entries for Byoung-Tak Zhang Je-Gun Joung

Citations