- a unbalanced k-ary tree
base(with internal nodes that represent operators and leafs representing values) from the space of all unbalanced k-ary trees
- a distance function
delta(t, t') = number of edit operations to transform t into t'
- the edit operations
add(t)(adding a random leaf),
remove(t)(removing a random subtree),
relabel(t)(relabel a random node)
For a genetic algorithm I need to generate a population of
ntrees that are not more than
kedit operations away from
base. I must prove that any tree within this space has equal propablity to be generated and that any tree can be generated.
The only idea I can think of was:
draw a random number
define a random sequence
This aproach though does not garanty that any tree less than k away from base is generated?!
My other approach:
Generate a random tree
seqthe optimal set of edit operations beween
[k-d, d]edit operations to
I am not shure if in that way any tree can be generated with the same propability.