Mining significant trend sequences in dynamic attributed graphs

Abstract

Discovering patterns in graphs has many applications such as social network, biological and chemistry data analysis. Although many algorithms were proposed to identify interesting patterns in graphs, most of them consider simple types of graphs such as static graphs or graphs having a single attribute per vertex. Recently, studies have considered discovering frequent patterns in dynamic attributed graphs. These graphs can represent not only relationships between entities but also how they evolve over time, and describe entities with multiple attributes. Algorithms for mining frequent patterns in dynamic attributed graphs select patterns based on their occurrence frequency. But a major drawback of this approach is that many frequent patterns may contain entities that are weakly correlated. Thus, numerous frequent but spurious patterns may be shown to the user. To allows discovering strongly correlated patterns in dynamic attributed graphs, this paper proposes a novel significance measure named Sequence Virtual Growth Rate. It allows evaluating if a pattern represents entities that are correlated in terms of their proximity in a graph over time. Based on this measure a novel type of graph patterns is defined called Significant Trend Sequence. To efficiently mine these patterns, two algorithms named TSeqMinerdfs−bfs and TSeqMinerdfs−dfs are proposed. They rely on a novel upper bound and pruning strategy to reduce the search space. Experimental results show that the proposed algorithms are efficient and can identify interesting patterns in real-world social network and flight data.