×

Classifying uncovered examples by rule stretching. (English) Zbl 1006.68507

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, 41-50 (2001).
Summary: This paper is concerned with how to classify examples that are not covered by any rule in an unordered hypothesis. Instead of assigning the majority class to the uncovered examples, which is the standard method, a novel method is presented that minimally generalises the rules to include the uncovered examples. The new method, called Rule Stretching, has been evaluated on several domains (using the inductive logic programming system Virtual Predict for induction of the base hypothesis). The results show a significant improvement over the standard method.
For the entire collection see [Zbl 0971.00030].

MSC:

68N17 Logic programming
68T05 Learning and adaptive systems in artificial intelligence