关键词: 频繁子图挖掘, AGM算法, 子图同构

Abstract: AGM（Apriori-based Graph Mining） algorithm is the first one to put the Apriori idea into the use of frequent sub-graph mining.This algorithm is simple and based on recursion statistics.But graph data set is very large and sub-graph isomorphism problem is available，when candidate subgraphs are generated and so many redundant sub-graphs would be generated，which makes the high cost in computing time.An improved method based on AGM is proposed to get the reduction of redundant sub-graphs and make the new algorithm more efficient in computing time，compared to AGM algorithm.This paper examines the computing time for various minimum support，the result of which proves that the improved algorithm cuts down the computing time，compared to AGM algorithm，improving the efficiency of frequent sub-graph mining.

Key words: frequent sub-graph mining, Apriori-based Graph Mining（AGM） algorithm, sub-graph isomorphism