FSP:A Graph-based Frequent Structure Pattern Mining Algorithm
Chen Li-song · Microelectronics & Computer · 2007
Investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called FSP(frequent structure pattern mining).FSP builds a new lexicographic order among graphs,and maps each graph to a unique minimum DFS code as its canonical label.Based on this lexicographic order.FSP adopts the depth-first search strategy to mine frequent connected subgraphs efficiently,without candidate generation.Our performance study shows that FSP substantially outperforms previous algorithms.