An Improved Algorithm on Frequent Subgraph Query

Abstract

This paper studies the frequent subgraph query issues on graph data set. Combining with the approach that frequent subtree extend to frequent subgraphs proposed by Xian-Tong Li, we propose a new algorithm. This algorithm improved its storage structure avoiding direct subgraph isomorphism judgment, reduced the stability requirements on graph set, and enchanced the overall efficiency of the algorithm.