Algorithm for Frequent Subgraph Mining
Yang Tan · Jisuanji gongcheng · 2012
To reduce the frequent subgraph canonical detection time complexity,this paper discusses the relevant properties of the canonical adjacency matrix.In order to reduce the generation of redundant candidate subgraphs,it proposes the theorem to reduce redundancy candidate subgraph generation,and proves its correctness.Based on this,it proposes a frequent subgraph mining algorithms called FSM_CAM.Experimental results show that FSM_CAM algorithm's efficiency is greatly improved compared with existing frequent subgraph mining algorithms FsubGraphM.