Design and Implementation of A Frequent Subgraph Mining Algorithm gSpan
Yong Liu · Intelligent Computer and Applications · 2011
Since most of the graph mining algorithms are needed to make frequent subgraph,frequent subgraph mining is gradually becoming the hot spot in the field of research.At present,many efficient frequent subgraph mining algorithms have been proposed.Among them,gSpan algorithm is currently accepted as the best frequent subgraph mining algorithm.However,in the compound datasets,the performance of gSpan algorithm based on the special structure could be further optimized.The paper uses the symetry of the molecular structure of compounds and the unequilibrium of the distribution of atomic types,and puts forward some new optimization strategy,so as to further improve the performance of gSpan algorithm.Because gSpan algorithm is very vital in graph mining areas and the entire data mining field,this paper designes and implementes gSpan algorithm.Meanwhile,the paper also prepares to adopt the optimization strategy in the literature[4],further improves the gSpan algorithm operation efficiency in compound datasets.