Skip to main content
Log in

Analogical learning and automated rule constructions

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

This paper describes some experiments of analogical learning and automated rule construction. The present investigation focuses on knowledge acquisition, learning by analogy, and knowledge retention. The developed system initially learns from scratch, gradually acquires knowledge from its environment through trial-and-error interaction, incrementally augments its knowledge base, and analogically solves new tasks in a more efficient and direct manner.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Booker, L. B., Intelligent behavior as adaptation to the task environment. Doctoral dissertation, Department Computer and Communication Sciences, University of Michigan, Ann Arbor MI 1982.

    Google Scholar 

  2. Carbonell, J. G., Learning by analogy: Formulating and generalizing phans from past experience. InMachine Learning: An artificial intelligence approach, Tioga, Palo Alto, CA, 1983.

  3. Holland, J.H., Adaptation in Natural and Artificial Systems. The University of Michigan Press, 1975.

  4. Holland, J.H. and Reitman, J.S., Cognitive Systems Based on Adaptive Algorithms. Pattern-Directed Inference Systems. Academic Press, New York, 1978.

    Google Scholar 

  5. Holland, J. H., Escaping Brittleness: The Possibilities of General Purpose Learning Algorithms Applied to Parallel Rule-Based Systems. Machine Learning (II): 593–623, Morgan Kaufmann, 1986.

  6. Goldberg, D. E., Computer-Aided Gas Pipeline Operation Using Genetic Algorithms and Rule Learning. Ph. D. Thesis, University of Michigan, 1983.

  7. Grefenstette, J. J. (Ed.), Proceedings of the Second International Conference on Genetic Algorithms and Their Applications, Cambridge, MA: Erlbaum.

  8. Nilsson, N.J., Artificial Intelligence Prepares for 2001, The AI Magazine (winter), 7–14, 1983.

  9. Riolo, R.L., CFS-C: A package of domain independent subroutines for implementing classifier systems in arbitrary, user-defined environments. Logic of Computer Group, Division of Computer Science and Engineering, University of Michigan, 1986.

  10. Mackintosh, N.J., The Psychology of Animal Learning. Academic Press, New York, 1974.

    Google Scholar 

  11. Smith, S.F., A Learning System Based on Genetic Adaptive Algorithms. Ph.D. thesis, University of Pittsburgh, 1980.

  12. Zhou, H.H. and Grefenstette, J.J., Induction of Finite Automata by Genetic Algorithms. In Proceedings of 1986 IEEE International Conference on System, Man and Cybernetics, 170–174. Nov, 1986.

  13. Zhou, H.H., CSM: A genetic classifier system with memory for learning by analogy. Ph. D. thesis, Department of Computer Science, Vanderbilt University, 1987.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, H.H. Analogical learning and automated rule constructions. J. of Comput. Sci. & Technol. 6, 316–328 (1991). https://doi.org/10.1007/BF02948391

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948391

Keywords

Navigation