Frequent Subgraph Mining Algorithm of Gradually Right-most Extension

The gSpan algorithm has a better efficiency in the implementation as an efficient algorithm for frequent subgraph mining.It uses right-most extension to mine frequent subgraph.But it calculates the support of subgraph by subgraph isomorphism which is a NP complete problem and the calculation is complex.A new algorithm IgSpan was proposed,which could avoid subgraph isomorphism by using improved ADI++ storage structure to combine the expanded subgraph with the calculation of support.Experiments show that the algorithm improves the efficiency of frequent graph mining.