Mining generalized closed patterns from multi-graph collections

Abstract

Frequent approximate subgraph (FAS) mining has become an important technique into the data mining. However, FAS miners produce a large number of FASs affecting the computational performance of methods using them. For solving this problem, in the literature, several algorithms for mining only maximal or closed patterns have been proposed. However, there is no algorithm for mining FASs from multi-graph collections. For this reason, in this paper, we introduce an algorithm for mining generalized closed FASs from multi-graph collections. The proposed algorithm obtains more patterns than the maximal ones, but less than the closed one, covering patterns with small frequency differences. In our experiments over two real-world multi-graph collections, we show how our proposal reduces the size of the FAS set.