Extraction of Community Transition Rules from Data Streams as Large Graph Sequence

In this study, we treat transactional sets of data streams as a graph sequence. This graph sequence represents both the relational structures of data for each period and changes in these structures. In addition, we analyze changes in a community in this graph sequence. Our proposed algorithm extracts community transition rules to detect communities that appear irregularly in a graph sequence using our proposed method combined with adaptive graph kernels and hierarchical clustering. In experiments using synthetic datasets and social bookmark datasets, we demonstrate that our proposed algorithm detects changes in a community appearing irregularly.