Efficiently mining δ-tolerance closed frequent subgraphs

Abstract

The output of frequent pattern mining is a huge number of frequent patterns, which are very redundant, causing a serious problem in understandability. We focus on mining frequent subgraphs for which well-considered approaches to reduce the redundancy are limited because of the complex nature of graphs. Two known, standard solutions are closed and maximal frequent subgraphs, but closed frequent subgraphs are still redundant and maximal frequent subgraphs are too specific. A more promising solution is ?-tolerance closed frequent subgraphs, which decrease monotonically in ?, being equal to maximal frequent subgraphs and closed frequent subgraphs for ?=0 and 1, respectively. However, the current algorithm for mining ?-tolerance closed frequent subgraphs is a naive, two-step approach in which frequent subgraphs are all enumerated and then sifted according to ?-tolerance closedness. We propose an efficient algorithm based on the idea of reverse-search by which the completeness of enumeration is guaranteed and for which new pruning conditions are incorporated. We empirically demonstrate that our approach significantly reduced the amount of real computation time of two compared algorithms for mining ?-tolerance closed frequent subgraphs, being pronounced more for practical settings.