Closed Frequent Subgraph Mining by Graph Closure Operation and Its Parallelization

在这项工作中，我们提出了图闭包算子，以及一个有效的方法图同构检查，利用出现的图形模式。给定一个子图，该算子生成一个包含它的闭子图，其中闭子图是与给定子图具有相同频率的子图中的最大子图。在此基础上，提出了一种有效的枚举图数据库中所有可能的闭频繁子图的方法，并对其内部过程进行了并行化，提高了其可扩展性。

In this work, we proposed the graph closure operator, as well as an efficient method for graph isomorphism checking that takes advantage of occurrences of a graph pattern. Given a subgraph, the operator generates a closed subgraph including it, where the closed subgraph is the maximum subgraph among those which have the same frequency as the given one. Then, we developed an efficient method for enumerating all possible closed frequent subgraphs in a graph database by means of them, and parallelized its inner processes to improve its scalability.