Program evolution with explicit learning

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 3, Issue , 2003, Pages 1639-1646

  Shan, Y ^a   McKay, R I ^a   Abbass, H A ^a   Essam, D ^a  

^a University College   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GENETIC PROGRAMMING;

BENCH-MARK PROBLEMS; ESTIMATION OF DISTRIBUTION ALGORITHMS; EVOLUTIONARY COMPUTING; EXPLICIT LEARNING; GENETIC OPERATORS; NEW APPROACHES; PROGRAM EVOLUTION; PROGRAM SYNTHESIS;

PROBABILITY DISTRIBUTIONS;

EID: 84901389359     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299869     Document Type: Conference Paper

References (27)

1. H. A. Abbass, N. X. Hoai, and R. I. McKay. AntTAG: A new method to compose computer programs using colonies of ants. In The IEEE Congress on Evolutionary Compirration, pages 1654-1659, 2002, .
2. P. J. Angeline. Two self adaptive crossover operations for genetic programming. In Advances in Generic Pmgramniing II, pages 89-110. MIT Press, 1995.
3. P. J. Angeline and J. B. Pollack. Coevolving highrlevel representations. 'In C. G. Langton. editor, Artificial Life III, volume XVII, pages 55-71, Santa Fe, New Mexico, 1994. Addison-Wesley.
4. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94- 163, Pittsburgh, PA, 1994.
5. S. Baluja and S. Davies. Using optimal dependencytrees for combinatorial optimization: Learning the 'structure of the search space. In D. H. Fisher, editor, Proc. 1997 International Conference on Machine Learning, pages 30-38, Tennessee, USA, 1997. Morgan Kaufmann.
6. S. Bhattacharyya, O. Pictet. and G. Zumbach. Knowledge-intensive genetic discovery in foreign exchange markets. IEEE Transactions on EvolutionaT Compurarion. 6(2): 169 -181, April 2002.
7. S.-H. Chen and C.-H. Yeh. Toward a computable approach to the efficient market hypothesis: An application of genetic programming. Joirrnal of Economic Dynamics and Control, 21:1043-1063, 1996.
8. N. Cramer. A representation for the adaptive generation of simple sequential programs. In Proc. of an Intl. Conf. on Genetic Algorithnis and their Applications, pages 183-187, Carnegie-Mellon University, 1985.
9. P. D'haeseleer. Context preserving crossover in genetic programming. In Proceedings ojthe 1994 IEEE World Congress on Computational Intelligence, volume I, pages 256-261, Orlando, Florida, USA, 27-29 1994. IEEE Press.
10. B. E., M. Dorigo, and T. Theraulaz. Fmrn Natural to Artificial Swarm Intelligence. Oxford University Press, New York, 1999.
11. H. Iba, H. de Garis, and T. Sato. Genetic programming using a minimum description length principle. In K. E. Kinnear, Jr.. editor, Advances in Generic Pmgraniming, pages 265-284. MIT Press, 1994.
12. H. Iba and H. D. Garis. Extending genetic programming with recombinative guidance. In Advances in Genetic Programming II, pages 69-88. MIT Press, 1996.
13. H. Jaske. One-step-aheah prediction of sunspots with genetic programming. In Proceedings of the Second Nordic Workshop on Genetic Algorithms and rheirApplicatios (2NWGA), Vaasa Finland, August 1996.
14. J.R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
15. R. S. Michalski. Learnable evolution model: Evolutionary processes guided by machine learning. Machine Learning, 38:9-40, 2000.
16. H. Muehlenbein and G. Paaß. From recombination of genes to the estimation of distributions i.binary parameters. In Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature, PPSN IV, pages 178-187.1996.
17. N. Y. Nikolaev and H. Iba. Regularization approach to inductive genetic programming. IEEE Transactions on Evolutionary Computation, pages 359-375, 2001.
18. M. O'Neill and C. Ryan. Grammatical evolution. IEEE Transactions on Evolutionary Computation, pages 319 -158, 2001.
19. M. Pelikan, D. E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Technical Report IlliGAL Report No. 99018, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Sept 1999.
20. P. Prusinkiewicz and A. Lindenmayer. The Algorithmic Beauty of Platits. Springer, 1990.
21. J. P. Rosca. Analysis of complexity drift in genetic programming. In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286-294, Stanford University, CA, USA, 13-16 1997. Morgan Kaufmann.
22. J. P. Rosca and D. H. Ballard. Genetic programming with adaptive representations. Technical Report TR 489, University of Rochester, Computer Science Department, Rochester, NY, USA, Feb. 1994.
23. B. J. Ross. Logic-based genetic programming with definite clause translation grammars. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolstionary Computation Conference, volume 2, page 1236, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.
24. R. P. Salustowicz and J. Schmidhuber. Probabilistic incremental program evolution. Evolutionary Computation, 5(2):123-141, 1997.
25. A. S. Weigend, B. A. Huberman, and D. E. Rumelhart. Predicting sunspots and exchange rates with connectionist networks. In Nonlinear Modelling and Forecasting, pages 395-432. Addison-Wesley, 1992.
26. P. A. Whigham. Grammatically-based genetic programming. In J.P. Rosca, editor, Proceedings of the Workshop on Genetic Programimng: From Theory to Real-World Applications, pages 33-41, Tahoe City, California, USA, 9 1995.
27. B.-T. Zhang and H. Muhlenbein. Balancing accuracy and parsimony in genetic programming. Evolutionary Computation, 3(1): 17-38, 1995.