Mining interesting sets and rules in relational databases

In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain items from several relations, and a support measure that can easily be interpreted based on the key dependencies as defined in the relational scheme. We present an efficient depth-first algorithm, which mines relational itemsets directly from arbitrary relational databases. Several experiments show the practicality and usefulness of the proposed approach.

• Type: Conference
• Year: 2010
• Where: SAC
• Authors: Bart Goethals, Wim Le Page, Michael Mampaey
• Keywords: Applied Computing, Arbitrary Relational Databases, Mines Relational Itemsets, Relational Itemsets, SAC 2010