Research on the Mining Algorithms for Maximal Frequent Subgraphs
Zhao Qi · Computer Engineering and Science · 2009
With the extensive application of graphs,their sizes are expanding unceasingly. Therefore it is imperative to improve the efficiency of mining the frequent subgraphs. According to the huge number of possible subgraphs,this paper proposes an algorithm MFME for mining maximal frequent subgraphs,which greatly reduces the number of the subgraph sets. The algorithm MFME which is based on the idea of mapping focuses on mapping the edge from the graph set to the edge table and it improves the efficiency of the algorithm effectively. The experimental results show that MFME is more efficient than algorithm SPIN.