Kumara Sastry

Discovering deep building blocks for competent genetic algorithms using chance discovery via KeyGraphs

Goldberg, D. E., Sastry, K., Ohsawa, Y. (2003). In Ohsawa, Y., McBurney, P. (Eds.), Chance Discovery. 276—302. Berlin: Springer-Verlag. [Full paper - PDF] [Full paper - PS].

Abstract:

In this paper, we see whether chance discovery in the form of KeyGraphs can be used to reveal deep building blocks to competent genetic algorithms, thereby speeding innovation in particularly difficult problems. On an intellectual level, showing the connection between Key- Graphs and genetic algorithms as related pieces of the innovation puzzle is both scientifically and computationally interesting. GAs represent that aspect of human innovation that tries to innovate through the exchange or cross-fertilization of notions contained in different ideas; the KeyGraph procedure represents that portion of human innovation that pays special attention to and interprets salient fortuitous events. The paper goes beyond mere conjecture and performs pilot studies that show how KeyGraphs and competent GAs can work together to solve the problem of deep building blocks; the work is promising and steps toward a practical computational combine of the two procedures are suggested.

Related Posts:

• Discovering building blocks for human based genetic algorithms
• Designing competent mutation operators via probabilistic model building of neighborhoods
• Probabilistic model building and competent genetic programming
• Efficiency enhancement of probabilistic model building genetic algorithms
• Combining Competent Crossover and Mutation Operators: A Probabilistic Model Building Approach

Comments are closed.