论文信息 - Classifying Uncovered Examples by Rule Stretching

Classifying Uncovered Examples by Rule Stretching

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.

Henrik Boström | Martin Eineborg

[1] Luc De Raedt,et al. On Multi-class Problems and Discretization in Inductive Logic Programming , 1997, ISMIS.

[2] Stephen Muggleton,et al. Protein secondary structure prediction using logic-based machine learning , 1992 .

[3] Henrik Boström,et al. Induction of Logic Programs by Example-Guided Unfolding , 1999, J. Log. Program..

[4] William W. Cohen. Fast Effective Rule Induction , 1995, ICML.

[5] Stephen Muggleton,et al. Analogical Prediction , 1999, ILP.

[6] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.

[7] Peter Clark,et al. Rule Induction with CN2: Some Recent Improvements , 1991, EWSL.

[8] Henrik Boström,et al. Combining Divide-and-Conquer and Separate-and-Conquer for Efficient and Effective Rule Induction , 1999, ILP.

[9] J. W. Lloyd,et al. Foundations of logic programming; (2nd extended ed.) , 1987 .