A Fast Method to Enumerate Frequent Changing Patterns from Graph Sequences

Abstract

In recent years, the mining of frequent subgraph patterns in a set of labeled graph or a large labeled graph has been extensively studied, and some major algorithms to find a complete set of frequent patterns within a limited amount of time have been established. However, to out best knowledge, any methods have not been proposed to find sequential patterns of graphs from a long graph sequence or a set of graph sequences. In this paper, we propose an efficient method to enumerate frequent sequential patterns of graphs by defining a union graph of graphs and operators of graph transformation. Its performance has been evaluated by using artificial dataset, and the efficiency of the approach has been confirmed with respect to the computation time.