Frequent subgraphs mining algorithm based on prefix node
一种基于前缀节点的频繁子图挖掘算法

Based on the prefix node method in frequent tree mining algorithms, adopting core-braches-connecting vector partition on graphs, this paper provided a new algorithm CBE. The CBE algorithm could accomplish canonical determining in constant time on candidate pattern graphs expanded from branches. Performance testing proves that the efficiency of subgraphs mining is improved by CBE algorithm.