计算机工程与科学2009，Vol.31Issue(12)：67-70,4.DOI:10.3969/j.issn.1007-130X.2009.12.020
最大频繁子图挖掘算法研究
Research on the Mining Algorithms for Maximal Frequent Subgraphs
摘要
Abstract
With the extensive application of graphs, their sizes are expanding unceasingly. Therefore it is imperative to improve the efficiency of mining the frequent subgraphs. According to the huge number of possible subgraphs, this paper proposes an algorithm MFME for mining maximal frequent subgraphs, which greatly reduces the number of the subgraph sets. The algorithm MFME which is based on the idea of mapping focuses on mapping the edge from the graph set to the edge table and it improves the efficiency of the algorithm effectively. The experimental results show that MFME is more efficient than algorithm SPIN.关键词
数据挖掘/频繁子图/子图同构/映射树Key words
data mining/frequent subgraphs/subgraphs isomorphism/mapping tree分类
信息技术与安全科学引用本文复制引用
李继腾,骆志刚,丁凡,田文颖,赵琦..最大频繁子图挖掘算法研究[J].计算机工程与科学,2009,31(12):67-70,4.基金项目
国家863计划资助项目(2007AA01Z106) （2007AA01Z106）
国家自然科学基金资助项目(60673018) （60673018）
