Inductive Logic Programming for Knowledge Discovery in Databases

  • Wrobel S
N/ACitations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Relational data mining algorithms and systems are capable of directlydealing with multiple tables or relations as they are found in today'srelational databases. This reduces the need for manual preprocessingand allows problems to be treated that cannot be handled easily withstandard single-table methods. This paper provides a tutorial-styleintroduction to the topic, beginning with a detailed explanationof why and where one might be interested in relational analysis.We then present the basics of Inductive Logic Programming (ILP),the scientific field where relational methods are primarily studied.After illustrating the workings of MIDOS, a relational methods forsubgroup discovery, in more detail, we show how to use relationalmethods in one of the current data mining systems.

Cite

CITATION STYLE

APA

Wrobel, S. (2001). Inductive Logic Programming for Knowledge Discovery in Databases. In Relational Data Mining (pp. 74–101). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-04599-2_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free