Mining approximate multi-relational patterns

Three recent trends aim to make local pattern mining more directly suited for use on data as it presents itself in practice, namely in a multi-relational form and affected by noise. The first of these trends is the generalisation of local pattern syntaxes to approximate, noise-tolerant, variants (notably fault-tolerant itemset mining and community detection). The second of these trends is to develop pattern syntaxes that are directly applicable to multi-relational data. The third one is to better quantify the interestingness of and redundancy between such local patterns. In this paper we leverage recent results from these lines of research to introduce a noise-tolerant pattern syntax for multi-relational data. We show how enumerating all patterns of this syntax in a given database can be done remarkably efficiently. We contribute a way to quantify the interestingness of these patterns, thus overcoming the pattern explosion problem. And finally, we show the usefulness of the pattern syntax and the scalability of the algorithm by presenting experimental results on real world and synthetic data.