There exist large data in science and business. Existing ILP systems cannot be applied effectively for data sets with 10000 data points. In this paper, we consider a technique which can be used to apply for more than 10000 data by simplifying it. Our approach is called Approximative Generalisation and can compress several data points into one example. In case that the original examples are mixture of positive and negative examples, the resulting example is ascribed in probability values representing proportion of positiveness. Our longer term aim is to apply on large Chess endgame database to allow well controlled evaluations of the technique. In this paper we start by choosing a simple game of Noughts and Crosses and we apply mini-max backup algorithm to obtain database of examples. These outcomes are compacted using our approach and empirical results show this has advantage both in accuracy and speed. In further work we hope to apply the approach to large database of both natural and artificial domains.
[1]
Christopher H. Bryant,et al.
Functional genomic hypothesis generation and experimentation by a robot scientist
,
2004,
Nature.
[2]
G. Plotkin.
Automatic Methods of Inductive Inference
,
1972
.
[3]
Ken Thompson,et al.
Retrograde Analysis of Certain Endgames
,
1986,
J. Int. Comput. Games Assoc..
[4]
Shan-Hwei Nienhuys-Cheng,et al.
Foundations of Inductive Logic Programming
,
1997,
Lecture Notes in Computer Science.
[5]
Luc De Raedt,et al.
Inductive Logic Programming: Theory and Methods
,
1994,
J. Log. Program..
[6]
Luc De Raedt,et al.
Probabilistic inductive logic programming
,
2004
.