New efficient width-first algorithm for mining frequent subgraph
Wei Guo Song · Systems engineering and electronics · 2008
Frequent subgraph mining is an active research topic in the data mining field.Based on the classical Apriori algorithm,a novel graph mining algorithm,Apriori-Graph,is proposed.Firstly,to lower the complexity of computing canonical codes of the adjacency matrix of graphs,a new vertex sorting strategy is introduced.Meanwhile,the sorting strategy can also speed the matching process of sequences of canonical codes.Secondly,aiming at the frequent subgraph,the process of generation for candidates is standareized.Finally,to ease the burden of frequency-checking,which is the bottle-neck of Apriori-inspired algorithms,several properties are discussed.Thus,the cost of frequency-checking is lowered. Experimental results show the proposed algorithm is efficient.