A declarative language bias for levelwise search of first-order regularities

  • Irene Weber
Communications 3A Learning and Knowledge Discovery
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1609)


The discovery of interesting patterns in relational databases is an important data mining task. In the framework of descriptive Inductive Logic Progamming (ILP), we present a refinement operator and hypothesis language declaration formalism that successfully combine a function-free first-order hypothesis language with the levelwise search principle. In particular, the hypothesis space is structured by the subset relation between hypotheses, and the refinement operator is based on the candidate generation procedure of the Apriori algorithm which is extended to allow for user-defined constraints on the combinations of literals. Experimental results show the usefulness of the approach.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Agrawal et al. Fast discovery of association rules. In U. Fayyad et al. (eds), Advances in Knowledge Discovery and Data Mining, 1996.Google Scholar
  2. 2.
    L. Dehaspe and L. De Raedt. Mining association rules in multiple relations. In Proc. Seventh Int. Workshop on Inductive Logic Programming (ILP’97), 1997.Google Scholar
  3. 3.
    L. De Raedt and L. Dehaspe. Clausal discovery. Machine Learning 26, 1997.Google Scholar
  4. 4.
    J-U. Kietz and M. Lübbe. An efficient subsumption algorithm for inductive logic programming. In Proc. 4th Int. Workshop on Inductive Logic Programming, volume 237 of GMD-Studien, 1994.Google Scholar
  5. 5.
    J-U. Kietz and S. Wrobel. Controlling the complexity of learning in logic through syntactic and task-oriented models. In S. Muggleton, (ed.), Proc. 1st Int. Workshop on Inductive Logic Programming, 1991.Google Scholar
  6. 6.
    G. Lindner and K. Morik. Coupling a relational learning algorithm with a database system. In Y. Kodratoff et al., (eds), Workshop Notes of the ECML-95 Workshop Statistics, Machine Learning and Knowledge Discovery in Databases, 1995.Google Scholar
  7. 7.
    H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1(3), 1997.Google Scholar
  8. 8.
    S. Muggleton. Inverse entailmentand Progol. New Generation Computing 13(3–4), 1995.Google Scholar
  9. 9.
    R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proc. KDD-97, 1997.Google Scholar
  10. 10.
    I. Weber. Discovery of first-order regularities in a relational database using offline candidate determination. In Proc. 7th Int. Workshop on ILP, 1997.Google Scholar
  11. 11.
    I. Weber. A declarative language bias for levelwise search of first-order regularities. In F. Wysotzki et al. (eds), Proc. FGML-98, Technical Report 98/11 des Fachbereiches Informatik, TU Berlin, 1998.Google Scholar
  12. 12.
    Stefan Wrobel. An algorithm for multi-relational discovery of subgroups. In Proc. 1st Europ. Symp. on Principles of Knowledge Discovery and Data Mining, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Irene Weber
    • 1
  1. 1.Institut für InformatikUniversität StuttgartStuttgartGermany

Personalised recommendations