Artificial Immune System Programming for Symbolic Regression

  • Colin G. Johnson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2610)

Abstract

Artificial Immune Systems are computational algorithms which take their inspiration from the way in which natural immune systems learn to respond to attacks on an organism. This paper discusses how such a system can be used as an alternative to genetic algorithms as a way of exploring program-space in a system similar to genetic programming. Some experimental results are given for a symbolic regression problem. The paper ends with a discussion of future directions for the use of artificial immune systems in program induction.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    P.J. Angeline. Subtree crossover: Building block engine or macromutation? In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max H. Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 9–17. Morgan Kaufman, 1997.Google Scholar
  2. 2.
    M. Ayara, J. Timmis, R. de Lemos, L.N. de Castro, and R. Duncan. Negative selection: How to generate detectors. In J. Timmis and P.J. Bentley, editors, Proceedings of the First International Conference on Artificial Immune Systems, pages 89–98. University of Kent, 2002.Google Scholar
  3. 3.
    John A. Clark and Jeremy L. Jacob. Protocols are programs too: the meta-heuristic search for security protocols. Information and Software Technology, 43(14):891–904, 2001.CrossRefGoogle Scholar
  4. 4.
    Nichael Lynn Cramer. A representation for the adaptive generation of simple sequential programs. In John J. Greffenstette, editor, Proceedings of the First International Conference on Genetic Algorithms and their Applications, pages 183–187. Erlbaum, 1985.Google Scholar
  5. 5.
    Dipankar Dasgupta and Nii Attoh-Okine. Immunity-based systems: a survey. In Proceedings of the 1997 IEEE International Conference on Systems, Man and Cybernetics. IEEE Press, 1997.Google Scholar
  6. 6.
    Leandro N. de Castro and Jon Timmis. An artificial immune network for multimodal function optimization. In Proceedings of the 2002 Congress on Evolutionary Computation, pages 699–704. IEEE Press, 2002.Google Scholar
  7. 7.
    Leandro N. de Castro and Jon Timmis. Artificial Immune Systems: A New Computational Intelligence Approach. Springer, 2002.Google Scholar
  8. 8.
    L.N. de Castro and F.J. Von Zuben. Learning and optimization using the clonal selection principle. IEEE Transactions on Evolutionary Comptuation, 6(3):239–251, 2002.CrossRefGoogle Scholar
  9. 9.
    Patrik D’haeseleer, Stephanie Forrest, and Paul Helman. An immunological approach to change detection: Algorithms, analysis and implications. In IEEE Symposium on Security and Privacy. IEEE Press, 1996.Google Scholar
  10. 10.
    Emma Hart and Peter Ross. The evolution and analysis of a potential antibody library for use in job-shop scheduling. In David Corne, Marco Dorigo, and Fred Glover, editors, New Ideas in Optimization, pages 185–202. McGraw-Hill, 1999.Google Scholar
  11. 11.
    Niels K. Jerne. Towards a network theory of the immune system. Annals of Immunology (Institute Pasteur), 125C:373–389, 1974.Google Scholar
  12. 12.
    Terry Jones. Crossover, macromutation and population-based search. In L. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 73–80. Morgan Kaufmann, 1995.Google Scholar
  13. 13.
    J.O. Kephart, G.B. Sorkin, and M. Swimmer. An immune system for cyberspace. In Proceedings of the 1999 IEEE International Conference on Systems, Man and Cybernetics, pages 879–884, 1997.Google Scholar
  14. 14.
    T. Knight and J. Timmis. AINE: An immunological approach to data mining. In N. Cencone, T. Lin, and X. Wu, editors, Proceedings of the 2001 IEEE International Conference on Data Mining, pages 297–304. IEEE Press, 2001.Google Scholar
  15. 15.
    John R. Koza. Genetic Programming: On the Programming of Computers by means of Natural Selection. Series in Complex Adaptive Systems. MIT Press, 1992.Google Scholar
  16. 16.
    John R. Koza. Genetic Programming II. Series in Complex Adaptive Systems. MIT Press, 1994.Google Scholar
  17. 17.
    Julian F. Miller and Peter Thomson. Cartesian genetic programming. In Poli et al. [22], pages 121–132. LNCS 1802.Google Scholar
  18. 18.
    Michael O’Neill and Conor Ryan. Grammatical evolution. IEEE Transactions on Evolutionary Computation, 5(4):349–358, August 2001.CrossRefGoogle Scholar
  19. 19.
    Una-May O’Reilly and Franz Oppacher. Program search with a hierarchical variable length representation: Genetic programming, simulated annealing and hill climbing. In Parallel Problem Solving from Nature III, Jerusalem, pages 397–406. Springer, 1994.Google Scholar
  20. 20.
    John O’Sullivan and Conor Ryan. An investigation into the use of different search strategies with grammatical evolution. In Poli et al. [22], pages 268–277. LNCS 1802.Google Scholar
  21. 21.
    R.C. Paton, H.S. Nwana, M.J.R. Shave, and T.J.M. Bench-Capon. An examination of some metaphorical contexts for biologically motivated computing. British Journal for the Philosophy of Science, 45:505–525, 1994.CrossRefGoogle Scholar
  22. 22.
    Riccardo Poli, Wolfgang Banzhaf, William B. Langdon, Julian Miller, Peter Nordin, and Terence C. Fogarty, editors. Proceedings of the 2000 European Conference on Genetic Programming. Springer, 2000. LNCS 1802.Google Scholar
  23. 23.
    Riccardo Poli and Nicholas Freitag McPhee. Exact GP schema theory for headless chicken crossover and subtree mutation. In Proceedings of the 2001 Congress on Evolutionary Computation. IEEE Press, 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Colin G. Johnson
    • 1
  1. 1.Computing LaboratoryUniversity of KentCanterbury, KentEngland

Personalised recommendations