<p>1) I think this depends on the implementation of linear GP you use. Since you're writing your own implementation, I would recommend looking at some other people's implementations. IMO, this really depends on what kind of linear GP system you wrote/are using. I haven't looked myself, but <a href="http://cs.gmu.edu/~eclab/projects/ecj/" rel="nofollow">ECJ</a> might have an implementation that you can reference.</p>

<p>2) There are TONS of methods to crossover/mutate your individuals. I would argue that you <strong>could</strong> perform crossover using either of the approaches you mention. The one you <strong>should</strong> use will depend on the problem you're tackling and how you represent your individuals. Sometimes it's best to design crossover and mutation methods specifically for your system. A Google Scholar search for various mutation and crossover operations in GP, GAs, and linear GP will give you A LOT to work with. </p>

<p>3) Time series forecasting is a particularly difficult problem. In my <strong>very limited</strong> experience, economic data can be pretty volatile. Using a standard linear GP algorithm probably won't give you especially good results. With a problem that difficult, you're going to need more advanced approaches than just different crossover/mutation operators. It might be worth your time to look into some probabilistic, generalization, or strongly-typed GP approaches. Check out the <a href="http://www.gp-field-guide.org.uk/" rel="nofollow">Field Guide to GP</a> for some more on those. Again, Google Scholar is a great resource for learning more about those.</p>

<p>I hope this helps!</p>

CC BY-SA 3.0
2011-11-18T15:10:36.447Z
Many thanks for the useful points, appreciated :)
Daniel
CC BY-SA 3.0
2011-11-16T15:44:43.793Z
2011-11-16T15:44:43.793Z
John Mark
<p>I have a few questions about linear genetic programming. I'm struggling to find much information on them, hopefully someone here can help me, it would be much appreciated.</p>

<p>1) Initialisation: When initialising the population, does each individual point to the same set of registers or register values, or is a separate space allocated to each individual ? </p>

<p>2) Crossover / mutation: Are the registers crossed over and mutated as well as the program bodies, or just the program bodies ? I am guessing they're not, but then how would one go about optimising the values in the registers ?</p>

<p>3) Crossover cont: What, based on your experience, is the most efficient method of crossover ?  I have written a linear GP, and have applied to various datasets for time series forecasting. One being linear, a few trigonometric, and some economic data. It works fine when given anything except the economic data. Why could this be ? My guess is that is has something to do with crossover, which at present is two point. Although i have tested other methods such as one point and uniform but they have not in any way improved the performance? The first few generations are ok, and then the fitness of the population seems to fluctuate randomly with no improvement whatsoever :(</p>

<p>These may seem like very simple, or strange questions. I have only just begun learning about this so please be nice ! :)</p>

<p>Many Thanks </p>

CC BY-SA 3.0
2011-11-06T22:17:39.300Z
What is a "register" in this context? What makes "Linear Genetic Programming" linear? Crossovers are tricky because you have to be careful do it in a semantic-pertaining way. You should motivate why you use genetic algorithms; have more precise/tailored methods failed?
Raphael
<machine-learning><genetic-algorithms><genetic-programming>
Linear Genetic Programming
Daniel
# Linear Genetic Programming

(Asked by: username_0 on 2011-11-06)

I have a few questions about linear genetic programming. I'm struggling to find much information on them, hopefully someone here can help me, it would be much appreciated.

1) Initialisation: When initialising the population, does each individual point to the same set of registers or register values, or is a separate space allocated to each individual ?

2) Crossover / mutation: Are the registers crossed over and mutated as well as the program bodies, or just the program bodies ? I am guessing they're not, but then how would one go about optimising the values in the registers ?

3) Crossover cont: What, based on your experience, is the most efficient method of crossover ? I have written a linear GP, and have applied to various datasets for time series forecasting. One being linear, a few trigonometric, and some economic data. It works fine when given anything except the economic data. Why could this be ? My guess is that is has something to do with crossover, which at present is two point. Although i have tested other methods such as one point and uniform but they have not in any way improved the performance? The first few generations are ok, and then the fitness of the population seems to fluctuate randomly with no improvement whatsoever :(

These may seem like very simple, or strange questions. I have only just begun learning about this so please be nice ! :)

Many Thanks

**Tags:** machine-learning, genetic-algorithms, genetic-programming

> **Comments:**
> **username_1**: What is a "register" in this context? What makes "Linear Genetic Programming" linear? Crossovers are tricky because you have to be careful do it in a semantic-pertaining way. You should motivate why you use genetic algorithms; have more precise/tailored methods failed?  

---

## 1 answers

### Answer by username_2 on 2011-11-16. Score: 2

1) I think this depends on the implementation of linear GP you use. Since you're writing your own implementation, I would recommend looking at some other people's implementations. IMO, this really depends on what kind of linear GP system you wrote/are using. I haven't looked myself, but [ECJ](http://cs.gmu.edu/~eclab/projects/ecj/) might have an implementation that you can reference.

2) There are TONS of methods to crossover/mutate your individuals. I would argue that you **could** perform crossover using either of the approaches you mention. The one you **should** use will depend on the problem you're tackling and how you represent your individuals. Sometimes it's best to design crossover and mutation methods specifically for your system. A Google Scholar search for various mutation and crossover operations in GP, GAs, and linear GP will give you A LOT to work with.

3) Time series forecasting is a particularly difficult problem. In my **very limited** experience, economic data can be pretty volatile. Using a standard linear GP algorithm probably won't give you especially good results. With a problem that difficult, you're going to need more advanced approaches than just different crossover/mutation operators. It might be worth your time to look into some probabilistic, generalization, or strongly-typed GP approaches. Check out the [Field Guide to GP](http://www.gp-field-guide.org.uk/) for some more on those. Again, Google Scholar is a great resource for learning more about those.

I hope this helps!

> **Comments:**
> **username_0**: Many thanks for the useful points, appreciated :)  

---

