Affiliations: [a] INSA-Lyon, LIRIS, UMR5205, Villeurbanne Cedex, France | [b] Department of Computer Science, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil | [c] Université Lyon 1, LIRIS, UMR5205, Lyon, France | [x] IRPI-CNR, Torino, Italy | [y] University of Torino, Torino, Italy | [z] University of Paris-Nord, Paris, France
Abstract: Graph mining methods have become quite popular and a timely challenge is to discover dynamic properties in evolving graphs or networks. We consider the so-called relational dynamic oriented graphs that can be encoded as n-ary relations with n ⩾ 3 and thus represented by Boolean tensors. Two dimensions are used to encode the graph adjacency matrices and at least one other denotes time. We design the pattern domain of multi-dimensional association rules, i.e., non trivial extensions of the popular association rules that may involve subsets of any dimensions in their antecedents and their consequents. First, we design new objective interestingness measures for such rules and it leads to different approaches for measuring the rule confidence. Second, we must compute collections of a priori interesting rules. It is considered here as a post-processing of the closed patterns that can be extracted efficiently from Boolean tensors. We propose optimizations to support both rule extraction scalability and non redundancy. We illustrate the added-value of this new data mining task to discover patterns from a real-life relational dynamic graph.
