Title: Efficient multi-relational data mining
Authors: Struyf, Jan ×
Blockeel, Hendrik #
Issue Date: 2001
Host Document: Proceedings of the Eleventh Belgian-Dutch Conference on Machine Learning pages:69-75
Conference: Belgian-Dutch Conference on Machine Learning edition:11 location:Antwerpen, Belgium date:December 21, 2001
Abstract: Multi-relational data mining algorithms search a large hypothesis space in order to find a suitable model for a given data set. During this search, a huge number of complex queries has to be evaluated on the data set. This explains why multi-relational data mining algorithms (e.g. ILP algorithms) typically have high run times. In this text we give an overview of two techniques designed to reduce these run times. We show that this is possible by exploiting similarities in both queries and data sets. The first technique is query-pack evaluation and the second one is parallel cross-validation.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
37390.pdf Published 283KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.