Discovery of First-Order Regularities in a Relational Database Using Offline Candidate Determination

. In this paper, we present an algorithm for the discovery of first order clauses holding in an relational database in the framework of the nonmonotonic ILP setting [1]. The algorithm adopts the principle of offline candidate determination algorithm used for mining association rules in large transaction databases [4]. Analoguous to the measures used in mining association rules, we define a support and a confidence measure as acceptance criteria for discovered hypothesis clauses. The algorithm has been implemented in C with an interface to the relational database management system INGRES. We present and discuss the results of an experiment in the KRK domain and conclude. 1 Introduction As the interest in knowledge discovery in databases (KDD) is generally increasing [2], some recent work on Inductive Logic Programming (ILP) concentrates on the application and adaption of ILP approaches to discovery tasks, e.g., [1, 3].Because of the related formalism, the first order approaches of ILP s..