Mining closed frequent graph based on partitioning graph database
Zheng Chao · Jisuanji yingyong yanjiu · 2011
In order to solve the shortage of the PartGraphMining algorithm for mining large-scale graph databases must repeatedly scan the database that could get all frequent subgraph patterns,this paper proposed a new algorithm IPMC.It could get all frequent subgraph patterns quickly without scanning the database repeatedly through storing graph’s hash address and supportting in the hash table.Furthermore,obtained all closed frequent graph patterns by the judgement of few subgraph isomorphism.The experimental result on real datasets shows that new algorithm improves the efficiency of mining.