Kumara Sastry

Probabilistic model building and competent genetic programming

Sastry, K., Goldberg, D. E. (2003). . In Riolo, R., Worzel, B. (Eds.), Genetic Programming Theory and Practice. 205—220. Boston, MA: Kluwer Academic Publishers. [Full paper - PDF] [Full paper - PS] [Presentation slides].

Abstract:
This paper describes a probabilistic model building genetic programming (PMBGP) developed based on the extended compact genetic algorithm (eCGA). Unlike traditional genetic programming, which use fixed recombination operators, the proposed PMBGA adapts linkages. The proposed algorithms, called the extended compact genetic programming (eCGP) adaptively identifies and exchanges non-overlapping building blocks by constructing and sampling probabilistic models of promising solutions. The results show that eCGP scales-up polynomially with the problem size (the number of functionals and terminals) on both GP-easy problem and boundedly difficult GP-hard problem.

Related Posts:

• Designing competent mutation operators via probabilistic model building of neighborhoods
• Efficiency enhancement of probabilistic model building genetic algorithms
• Combining Competent Crossover and Mutation Operators: A Probabilistic Model Building Approach
• Sporadic model building for efficiency enhancement of the hierarchical BOA
• Research

Comments are closed.