一种改进的闭图挖掘算法

频繁子图挖掘是各种图挖掘的基础和瓶颈,为了提高频繁子图挖掘算法的效率,在频繁闭图方法的基础上提出了一种新算法BPCG.首先使用了一种新结构表存储频繁子图集,从而不需扫描图集就可直接扩展最频繁邻接边及计算支持度阈值;然后算法又利用兄弟剪枝策略和删除局部频繁边,缩小搜索空间并减少不必要的操作.通过实验证明,算法优于其他子图挖掘算法.

An Improved Algorithm for Mining Close Graph

Frequent subgraph mining is the foundation and bottleneck of various graph mining.In order to improve the efficiency of frequent subgraph mining algorithm,a new algorithm BPCG based on frequent closed-graph mining method is proposed in this paper.Firstly,a new storage structure of the frequent subgraph is used for the algorithm,thus the most frequent adjacent edge can be expanded directly and the threshold of support can be calculated without scanning the database.And then,to narrow the search space and reduce the unnecessary operation,brother pruning strategy and deleting local frequent edge are adopted in the algorithm also.Experimental results show that the algorithm is superior to other subgraph mining algorithms.