Skip to main content
SpringerLink
Log in

Discovery of first-order regularities in a relational database using ofine candidate determination

  • Conference paper
  • First Online:
Inductive Logic Programming (ILP 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1297))

Included in the following conference series:

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. De Raedt and M. Bruynooghe. A theory of clausal discovery. In Proc. of IJCAI-93, Chambéry, 1993.

    Google Scholar 

  2. U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining. MIT Press, Cambridge, MA, 1995.

    Google Scholar 

  3. G. Lindner and K. Morik. Coupling a relational learning algorithm with a database system. In Y. Kodratoff, G. Nakhaeizadeh, and C. Taylor, editors, Workshop Notes of the ECML-95 Workshop Statistics, Machine Learning and Knowledge Discovery in Databases, 1995.

    Google Scholar 

  4. H. Mannila, H. Toivonen, and I. Verkamo. Efficient algorithms for discovering association rules. In AAAI-94 Workshop on Knowledge Discovery in Databases, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 20-22, 70565, Stuttgart, Germany

    Irene Weber

Authors
  1. Irene Weber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nada Lavrač Sašo Džeroski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weber, I. (1997). Discovery of first-order regularities in a relational database using ofine candidate determination. In: Lavrač, N., Džeroski, S. (eds) Inductive Logic Programming. ILP 1997. Lecture Notes in Computer Science, vol 1297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540635149_57

Download citation

  • DOI: https://doi.org/10.1007/3540635149_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63514-7

  • Online ISBN: 978-3-540-69587-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation