Digraph Labeled Frequent Subgraph Mining Algorithm Based on Canonical Code
Bian Hao-qiong · Science Technology and Engineering · 2012
For most of the frequent subgraph mining algorithms are based on the undirected graphs and areunsuitable for the more meaningful study on directed graphs,through the expansion of the gSpan code structure,the improved canonical form made the code apply to the directed graphs.It simplified the cost of data access operations by using the DADI+ + storage structure.It stored the Hash address and supporting in the Hash table without scanning the graph repeatedly and avoided the direct isomorphism testing in the mining.The experimental result on real datasets show the new proposed algorithm Dspan is correct and better than FFSM in efficiency of mining.