Using over-sampling in a Bayesian classifier EDA to solve deceptive and hierarchical problems

  • Authors:
  • David Wallin;Conor Ryan

  • Affiliations:
  • CSIS Department, University of Limerick, Limerick, Ireland;CSIS Department, University of Limerick, Limerick, Ireland

  • Venue:
  • CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Evolutionary Algorithms based on Probabilistic Modeling is a growing research field. Recently, hybrids that borrow ideas from the field of classification were introduced. We extend such hybrids, and evaluate four strategies for truncation of an over-sized population of samples. The strategies are evaluated over a number of difficult problems from the literature, among them, a hierarchical 256-bit HIFF problem. We show that over-sampling in conjunction with a truncation strategy can guide the search without increasing the number of performed fitness evaluations per generation, and that a truncation strategy which inverses the sampling pressure can, fitness-wise, perform significantly better than regular sampling.