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.
CITATION STYLE
Zhang, B. T., & Joung, J. G. (2000). Building Optimal committees of Genetic Programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1917, pp. 231–240). Springer Verlag. https://doi.org/10.1007/3-540-45356-3_23
Mendeley helps you to discover research relevant for your work.