Generalization as search

https://doi.org/10.1016/0004-3702(82)90040-6Get rights and content

Abstract

The problem of concept learning, or forming a general description of a class of objects given a set of examples and non-examples, is viewed here as a search problem. Existing programs that generalize from examples are characterized in terms of the classes of search strategies that they employ. Several classes of search strategies are then analyzed and compared in terms of their relative capabilities and computational complexities.

References (21)

  • F. Hayes-Roth

    Schematic classification problems and their solution

    Pattern Recognition

    (1974)
  • D.A. Waterman

    Generalization learning techniques for automating the learning of heuristics

    Artificial Intelligence

    (1970)
  • R.B. Banerji et al.

    Description languages and learning algorithms: A paradigm for comparison

    Internat. J. Policy Analysis Informat. Systems

    (1980)
  • J.S. Brown

    Steps toward automatic theory formation

  • J.S. Bruner et al.

    A Study of Thinking

    (1956)
  • B.G. Buchanan et al.

    Model-directed learning of production rules

  • F. Hayes-Roth et al.

    An automatically compliable recognition network for structured patterns

    IJCAI

    (1975)
  • E.B. Hunt

    Artificial Intelligence

    (1975)
  • R.S. Michalski

    aqval/1&3-Computer implementation of a variable valued logic system VL1 and examples of its application to pattern recognition

  • M. Minsky et al.

    Perceptions

    (1969)
There are more references available in the full text version of this article.

Cited by (0)

View full text