Skip to main content

Inductive operators and rule repair in a hybrid genetic learning system: Some initial results

  • Conference paper
  • First Online:
Evolutionary Computing (AISB EC 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 865))

Included in the following conference series:

Abstract

Symbolic knowledge representation schemes have been suggested as one way to improve the performance of classifier systems in the context of complex, real-world problems. The main reason for this is that unlike the traditional binary string representation, high-level languages facilitate the exploitation of problem specific knowledge. However, the two principal genetic operators, crossover and mutation, are, in their basic form, ineffective with regard to discovering useful rules in such representations. Moreover, the operators do not take into account any environmental cues which may benefit the rule discovery process. A further source of inefficiency in classifier systems concerns their capacity for forgetting valuable experience by deleting previously useful rules.

In this paper, solutions to both of these problems are addressed. First, in respect of the unsuitability of crossover and mutation, a new set of operators, specifically tailored for a high level language, are proposed. Moreover, to alleviate the problem of forgetfulness, an approach based on the way some enzyme systems facilitate the repair of genes in biological systems, is investigated.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Michalski, R.S. A Theory and Methodology of Inductive Learning, Artificial Intelligence, 20, 1983.

    Google Scholar 

  2. Holland, J.H, Holyoak, K.J, Nisbett, R.E, and Thagard, P.R. “Induction: Processes of Inference, Learning and Discovery” Cambridge: MIT Press, 1986.

    Google Scholar 

  3. Maynard Smith, J. Evolutionary Genetics, Oxford University Press, 1989.

    Google Scholar 

  4. Holland, J.H. Properties of the Bucket Brigade Algorithm, Proc. 1st Int. Conf. on Genetic Algorithms, 1985.

    Google Scholar 

  5. Grefenstette, J.J. Credit Assignment in Rule Discovery Systems Based on Genetic Algorithms, Machine Learning, 3, Kluwer Academic Publishers, 1988.

    Google Scholar 

  6. Zhou, H.H. CSM: A Genetic Classifier System with Memory for Learning by Analogy, PhD Thesis, Dept. of Computer Science, Vanderbilt University, Nashville, TN, 1987.

    Google Scholar 

  7. Paton, R.C.Some Perspectives on Adaptation and Environment, Internal Working Paper, Dept. of Computer Science, University of Liverpool, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Terence C. Fogarty

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fairley, A., Yates, D.F. (1994). Inductive operators and rule repair in a hybrid genetic learning system: Some initial results. In: Fogarty, T.C. (eds) Evolutionary Computing. AISB EC 1994. Lecture Notes in Computer Science, vol 865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58483-8_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-58483-8_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58483-4

  • Online ISBN: 978-3-540-48999-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics