zbMATH — the first resource for mathematics

Learning functions from imperfect positive data. (English) Zbl 1006.68512
Rouveirol, Céline (ed.) et al., Inductive logic programming. 11th international conference, ILP 2001, Strasbourg, France, September 9-11, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2157, 248-259 (2001).
Summary: The Bayesian framework of learning from positive noise-free examples derived by Muggleton is extended to learning functional hypotheses from positive examples containing normally distributed noise in the outputs. The method subsumes a type of distance based learning as a special case. We also present an effective method of outlier-identification which may significantly improve the predictive accuracy of the final multi-clause hypothesis if it is constructed by a clause-by-clause covering algorithm as e.g. in Progol or Aleph. Our method is implemented in Aleph and tested on two experiments, one of which concerns numeric functions while the other treats non-numeric discrete data where the normal distribution is taken as an approximation of the discrete distribution of noise.
For the entire collection see [Zbl 0971.00030].

68N17 Logic programming
68T05 Learning and adaptive systems in artificial intelligence
Full Text: Link