Classifying uncovered examples by Rule Stretching

11Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Eineborg, M., & Boström, H. (2001). Classifying uncovered examples by Rule Stretching. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2157, pp. 41–50). Springer Verlag. https://doi.org/10.1007/3-540-44797-0_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free