Linear Genetic Programming

1. Auflage. Softcover version of original hardcover Auflage 2007
ISBN: 978-1-4419-4048-3
Verlag: Springer US

Buch, Englisch, 315 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 505 g

Reihe: Genetic and Evolutionary Computation

Linear Genetic Programming presents a variant of genetic programming (GP) that evolves imperative computer programs as linear sequences of instructions, in contrast to the more traditional functional expressions or syntax trees. Primary characteristics of linear program structure are exploited to achieve acceleration of both execution time and evolutionary progress. Online analysis and optimization of program code lead to more efficient techniques and contribute to a better understanding of the method and its parameters. In particular, the reduction of structural variation step size and non-effective variations play a key role in finding higher quality and less complex solutions. Typical GP phenomena, such as non-effective code, neutral variations, and code growth are investigated from the perspective of linear GP.

This book serves as a reference for researchers; it also contains sufficient introductory material for students and those who are new to the field.

Zielgruppe

Research

Autoren/Hrsg.

Banzhaf, Wolfgang

Brameier, Markus F.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Technische Informatik Systemverwaltung & Management
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Maschinelles Lernen
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme

Inhaltsverzeichnis

Fundamental Analysis.- Basic Concepts of Linear Genetic Programming.- Characteristics of the Linear Representation.- A Comparison with Neural Networks.- Method Design.- Linear Genetic Operators I — Segment Variations.- Linear Genetic Operators II — Instruction Mutations.- Analysis of Control Parameters.- A Comparison with Tree-Based Genetic Programming.- Advanced Techniques and Phenomena.- Control of Diversity and Variation Step Size.- Code Growth and Neutral Variations.- Evolution of Program Teams.- Epilogue.

Über Autor(innen)

Markus Brameier received a PhD degree in Computer Science from the Department of Computer Science at University of Dortmund, Germany,in 2004.  From 2003 to 2004 he was a postdoctoral fellow at the Stockholm Bioinformatics Center (SBC), a collaboration between Stockholm University, the Royal Institute of Technology, and Karolinska Institute, in Sweden.  Currently he is Assistant Professor at the Bioinformatics Research Center (BiRC) of the University of Aarhus in Denmark.  His primary research interests are in bioinformatics and genetic programming.

Wolfgang Banzhaf is a professor of Computer Science at the Department of Computer Science of Memorial University of Newfoundland, Canada, and head of the department since 2003. Prior to that, he served for 10 years as Associate Professor for Applied Computer Science in the Department of Computer Science at University of Dortmund, Germany. From 1989 to 1993 he was a researcher with Mitsubishi Electric Corp.,first in MELCO’s Central Research Lab in Japan, then in the United States at Mitsubishi Electric Research Labs Inc., Cambridge, MA. Between 1985 and 1989 he was a postdoc in the Department of Physics, University of Stuttgart, Germany. He holds a PhD in Physics from the University of Karlruhe in Germany. His research interests are in the field of artificial evolution and self-organization studies. He has recently become more involved with bioinformatics.