Learning from positive data

  • Stephen Muggleton
Theory

DOI: 10.1007/3-540-63494-0_65

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1314)
Cite this paper as:
Muggleton S. (1997) Learning from positive data. In: Muggleton S. (eds) Inductive Logic Programming. ILP 1996. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 1314. Springer, Berlin, Heidelberg

Abstract

Gold showed in 1967 that not even regular grammars can be exactly identified from positive examples alone. Since it is known that children learn natural grammars almost exclusively from positives examples, Gold's result has been used as a theoretical support for Chomsky's theory of innate human linguistic abilities. In this paper new results are presented which show that within a Bayesian framework not only grammars, but also logic programs are learnable with arbitrarily low expected error from positive examples only. In addition, we show that the upper bound for expected error of a learner which maximises the Bayes' posterior probability when learning from positive examples is within a small additive term of one which does the same from a mixture of positive and negative examples. An Inductive Logic Programming implementation is described which avoids the pitfalls of greedy search by global optimisation of this function during the local construction of individual clauses of the hypothesis. Results of testing this implementation on artificially-generated data-sets are reported. These results are in agreement with the theoretical predictions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Stephen Muggleton
    • 1
  1. 1.Oxford University Computing LaboratoryParks RoadUK

Personalised recommendations