Concept learning by structured examples: an algebraic approach

  • Authors:
  • Fritz Wysotzki;Werner Kolbe;Ooachim Selbig

  • Affiliations:
  • Dept. of Artificial Intelligence, Central Institute of Cybernetics and Information Frocesses of the Academy of Sciences, Berlin, German Democratic Republic;Dept. of Artificial Intelligence, Central Institute of Cybernetics and Information Frocesses of the Academy of Sciences, Berlin, German Democratic Republic;Dept. of Artificial Intelligence, Central Institute of Cybernetics and Information Frocesses of the Academy of Sciences, Berlin, German Democratic Republic

  • Venue:
  • IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1981

Quantified Score

Hi-index 0.00

Visualization

Abstract

A system learning concepts from training samples consisting of structured objects is described. It is based on descriptions invariant under isomorphism. In order to get a unified mathematical formalism recent graph theoretic results are used- The structures are transformed into feature vectors and after that a concept learning algorithm developing decision trees is applied which is an extension of algorithms found in psychological experiments. It corresponds to a general-to-specific depth-first search with reexamination of past events. The generalization ability is demonstrated by means of the blocks world example and it is shown that the algorithm can successfully handle practical problems with samples of about one hundred of relatively complicated structures in a reasonable time. Additionally, the problem of representation and learning context dependent concepts is discussed in the paper.