The SMuRFIG algorithm provides a new and elegant approach toward the generalization of frequent itemset mining to the multi- relational case. SMuRFIG mines relational itemsets that contain items from several relations, and uses a support measure that can easily be interpreted based on the key dependencies as defined in the relational scheme. SMuRFIG is an efficient depth-first algorithm, which mines relational itemsets directly from arbitrary relational databases. Several experiments have shown the practicality and usefulness of the SMuRFIG algorithm.
SMuRFIG 1.2 C++ source code by Michael Mampaey, Wim Le Page
Technical Report on Mining Interesting Sets and Rules in Relational Databases by Bart Goethals, Wim Le Page, and Michael Mampaey, 2009
Relational Database Generator Python script by Michael Mampaey