Relational data mining algorithms and systems are capable of directly dealing with multiple tables or relations as they are found in today's relational databases. This reduces the need for manual preprocessing and allows problems to be treated that cannot be handled easily with standard single-table methods. This paper provides a tutorial-style introduction to the topic, beginning with a detailed explanation of 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 for subgroup discovery, in more detail, we show how to use relational methods in one of the current data mining systems.
Description
Inductive Logic Programming for Knowledge Discovery in Databases | SpringerLink
%0 Book Section
%1 wrobel2001inductive
%A Wrobel, Stefan
%B Relational Data Mining
%C Berlin, Heidelberg
%D 2001
%E Dzeroski, Saso
%E Lavrac, Nada
%I Springer Berlin Heidelberg
%K discovery kdd subgroup
%P 74--101
%R 10.1007/978-3-662-04599-2_4
%T Inductive Logic Programming for Knowledge Discovery in Databases
%U https://doi.org/10.1007/978-3-662-04599-2_4
%X Relational data mining algorithms and systems are capable of directly dealing with multiple tables or relations as they are found in today's relational databases. This reduces the need for manual preprocessing and allows problems to be treated that cannot be handled easily with standard single-table methods. This paper provides a tutorial-style introduction to the topic, beginning with a detailed explanation of 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 for subgroup discovery, in more detail, we show how to use relational methods in one of the current data mining systems.
%@ 978-3-662-04599-2
@inbook{wrobel2001inductive,
abstract = {Relational data mining algorithms and systems are capable of directly dealing with multiple tables or relations as they are found in today's relational databases. This reduces the need for manual preprocessing and allows problems to be treated that cannot be handled easily with standard single-table methods. This paper provides a tutorial-style introduction to the topic, beginning with a detailed explanation of 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 for subgroup discovery, in more detail, we show how to use relational methods in one of the current data mining systems.},
added-at = {2022-09-25T13:25:33.000+0200},
address = {Berlin, Heidelberg},
author = {Wrobel, Stefan},
biburl = {https://www.bibsonomy.org/bibtex/26189f75764ba310df131cda5930f2270/sdo},
booktitle = {Relational Data Mining},
description = {Inductive Logic Programming for Knowledge Discovery in Databases | SpringerLink},
doi = {10.1007/978-3-662-04599-2_4},
editor = {D{\v{z}}eroski, Sa{\v{s}}o and Lavra{\v{c}}, Nada},
interhash = {93de9d5eca98b7690ef325f83ea08eea},
intrahash = {6189f75764ba310df131cda5930f2270},
isbn = {978-3-662-04599-2},
keywords = {discovery kdd subgroup},
pages = {74--101},
publisher = {Springer Berlin Heidelberg},
timestamp = {2022-09-25T13:25:33.000+0200},
title = {Inductive Logic Programming for Knowledge Discovery in Databases},
url = {https://doi.org/10.1007/978-3-662-04599-2_4},
year = 2001
}