Discovery of Closed Hyperclique Patterns in a Sequence of Graphs

Abstract

In this paper, as one of the pattern mining in dynamic graphs, we focus on the problem of finding frequent, closed and correlated patterns of graph sequences in a long sequence of graphs. To solve this problem efficiently, an algorithm named CHPSS is proposed which effectively utilizes the generality ordering and the properties of correlation and closedness. Through the preliminary experiments with synthetic and real datasets, the effectiveness of CHPSS is confirmed.