Full perfect extension pruning for frequent subgraph mining

Abstract

Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algorithms and to enhance their capability to find meaningful graph fragments. Here we present a method to achieve the former, namely an improvement of what we called "perfect extension pruning" in an earlier paper [4]. With this method the number of generated fragments and visited search tree nodes can be reduced, often considerably, thus accelerating the search.We describe the method in detail and present experimental results that demonstrate its usefulness. © 2009 Springer-Verlag Berlin Heidelberg.