Skip to main content

Bayesian Automatic Programming

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3447))

Abstract

In this work a new approach, named Bayesian Automatic Programming (BAP), to inducing programs is presented. BAP integrates the power of grammar evolution and probabilistic models to evolve programs. We explore the use of BAP in two domains: a regression problem and the artificial ant problem. Its results are compared with traditional Genetic Programming (GP). The experimental results found encourage further investigation, especially to explore BAP in other domains and to improve the proposed approach to incorporating new mechanisms.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  2. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  3. Harik, G.R., Goldberg, D.E.: Learning linkage. Foundations of Genetic Algorithms 4, 247–262 (1996)

    Google Scholar 

  4. Ratle, A., Sebag, M.: Avoiding the bloat with probabilistic grammar-guided genetic programming. In: Collet, P., Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M. (eds.) EA 2001. LNCS, vol. 2310, pp. 255–266. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Salustowicz, R., Schmidhuber, J.: Evolving structured programs with hierarchical instructions and skip nodes. In: Proceedings of the 15th International Conference on Machine Learning, pp. 488–496. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  6. Sastry, K., Goldberg, D.: Probabilistic model building and competent genetic programming. Technical Report 2003013, University of Illinois (2003)

    Google Scholar 

  7. Pelikan, M., Goldberg, D., Cantú-Paz, E.: BOA: The bayesian optimization algorithm. In: GECCO 1999: Proceedings of Genetic and Evolutionary Computation Conference, vol. 1, pp. 525–532 (1999)

    Google Scholar 

  8. O’Neill, M., Ryan, C.: Grammatical Evolution. IEEE Transactions on Evolutionary Computation 5, 349–357 (2001)

    Article  Google Scholar 

  9. Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. Technical Report 99018, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Urbana (1999)

    Google Scholar 

  10. Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Carnegie Mellon University (1994)

    Google Scholar 

  11. Harik, G.: Linkage learning via probabilistic modeling in the ECGA. Technical Report 99010, Illinois Genetic Algorithms Laboratory, University of Illinois, Urbana (1999)

    Google Scholar 

  12. Larranaga, P., Lozano, J.A.: Estimation of Distribution Algorithms, A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  13. Heckerman, D.: A tutorial on learning with bayesian networks. Technical Report MSR-TR-95-06, Microsoft Corporation (1995)

    Google Scholar 

  14. Krause, P.: Learning probabilistic networks. The Knowledge Engineering Review 13, 321–351 (1998)

    Article  Google Scholar 

  15. Heckerman, D., Geiger, D., Chickering, M.: Learning bayesian networks: The combination of knowledge and statistical data. Technical Report MSR-TR-94-09, Microsoft Research (1994)

    Google Scholar 

  16. Cooper, G., Herskovits, E.: A bayesian method for the induction of probabilistic networks from data. Machine Learning 9, 309–345 (1992)

    MATH  Google Scholar 

  17. Russell, S., Norvig, P.: Artificial Intelligence, A Modern Approach, 2nd edn. Prentice-Hall, Englewood Cliffs (2003)

    Google Scholar 

  18. McKenzie, B.: Generating strings at random from a context free grammar. Technical Report TR-COSC 10/97, University of Canterbury (1997)

    Google Scholar 

  19. Rudnick, E.M., Patel, J.H., Greenstein, G.S., Niermann, T.M.: Sequential circuit test generation in a genetic algorithm framework. In: Design Automation Conference, pp. 698–704 (1994)

    Google Scholar 

  20. Research, G.A., GARAGe, A.G.: Lilgp (ver 1.1), http://garage.cps.msu.edu/software/lil-gp/lilgp-index.html

  21. Koza, J.R.: 12. In: Genetic Programming II, pp. 349–353. MIT Press, Cambridge (1998)

    Google Scholar 

  22. Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. Technical Report 2002007, Illinois Genetic Algorithms Laboratory, University of Illinois, Urbana (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Regolin, E.N., Pozo, A.T.R. (2005). Bayesian Automatic Programming. In: Keijzer, M., Tettamanzi, A., Collet, P., van Hemert, J., Tomassini, M. (eds) Genetic Programming. EuroGP 2005. Lecture Notes in Computer Science, vol 3447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31989-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31989-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25436-2

  • Online ISBN: 978-3-540-31989-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics