The Basic Gene Expression Algorithm
The fundamental steps of the basic gene expression algorithm are listed below in pseudocode:
- 1. Select function set;
- 2. Select terminal set;
- 3. Load dataset for fitness evaluation;
- 4. Create chromosomes of initial population randomly;
- 5. For each program in population:
- a) Express chromosome;
- b) Execute program;
- c) Evaluate fitness;
- 6. Verify stop condition;
- 7. Select programs;
- 8. Replicate selected programs to form the next population;
- 9. Modify chromosomes using genetic operators;
- 10. Go to step 5.
The first four steps prepare all the ingredients that are needed for the iterative loop of the algorithm (steps 5 through 10). Of these preparative steps, the crucial one is the creation of the initial population, which is created randomly using the elements of the function and terminal sets.
Read more about this topic: Gene Expression Programming
Famous quotes containing the words basic and/or expression:
“I fly in dreams, I know it is my privilege, I do not recall a single situation in dreams when I was unable to fly. To execute every sort of curve and angle with a light impulse, a flying mathematics—that is so distinct a happiness that it has permanently suffused my basic sense of happiness.”
—Friedrich Nietzsche (1844–1900)
“We must continually remind students in the classroom that expression of different opinions and dissenting ideas affirms the intellectual process. We should forcefully explain that our role is not to teach them to think as we do but rather to teach them, by example, the importance of taking a stance that is rooted in rigorous engagement with the full range of ideas about a topic.”
—bell hooks (b. 1955)