摘要
随着对大量结构化数据分析需求的增长,从图集合中挖掘频繁子图模式已经成为数据挖掘领域的研究热点。通过对目前有代表性的频繁子图挖掘算法的分析和比较,全面总结了各算法的特性及优缺点,并预测了今后的发展趋势。
With the increasing demand of massive structured data analysis, mining frequent subgraph patterns from graph datasets has been an attention-deserving field.This paper fully summarizes the characteristic and the advantages and disadvantages of these algorithms by analysis and comparison of popular frequent subgraph mining algorithm at present, and points out the future development trend.
基金
十一五"国家科技支撑课题"基于认知的名老中医学术思想临床经验挖掘技术研究
关键词
数据挖掘
频繁子结构
子图同构
data mining
frequent substructure
subgraph isomorphism
