New Algorithm of Mining Frequent Subgraph
Chai Ran · Jisuanji gongcheng · 2011
In order to resolve the problem of traditional Apriori algorithm that exists redundancy subgraphs when mining frequent subgraph,a new frequent subgraph mining algorithm called GAI is proposed.To reduce the number of scanning database,MADI index structure of three levels is proposed to store the information of graphs.It uses the expansion of the ETree to construct the frequent graph,and uses tables to store candidate subgraphs.It is avoided the redundancy subgraphs in expansion processing and scanning the entire database.It greatly simplifies the calculation of support degree and improves the query efficiency of graph isomorphism and subgraph isomorphism.Experimental results show GAI has the higher mining efficiency than Apriori algorithm.