APPARATUS AND METHOD FOR GENERATING MAXIMAL COMMON SUBGRAPHS BETWEEN FREQUENT SUBGRAPHS

摘要

Provided are an apparatus and a method for generating a maximum common subgraph between frequent subgraphs. The disclosed method for generating a maximum common subgraphs between frequent subgraphs, in an apparatus including a processor, comprises the following steps of: mining a plurality of frequent subgraphs which appear more than or equal to minimum support from a graph database; generating a frequent subgraph lattice which is a lattice-based data structure that indicates the inclusion relationship of the mining frequent subgraphs; and generating a maximum common subgraph by each pair of frequent subgraphs for the mining frequent subgraphs, based on the frequent subgraph lattice. Therefore, a maximum common subgraph between the frequent subgraphs can be efficiently generated.