Mining frequent maximal cliques efficiently by global view graph

Graph mining problem has been a popular research issue in recent years. Many kind of data can be represented as a graph and solve the particular problem by using a specific graph algorithm. Recently, the applications of graph mining are growing quantity. In this paper, the main subject is to find a specific topology called clique which is maximal and frequent in a set of graphs. In our approach, the graphs are first summarized into a global view graph. It is shown that any clique contains in the graph database, there must exist an isomorphic subgraph in the summarized graph according to our summarization process. Therefore, the frequent maximal clique mining process will focus on the global view graph. Moreover, by comparing with other existing methods, a set of experiments is performed to show the benefit of our approach.