| 两个经典频繁子图挖掘算法的对比与分析 |
| |
| 引用本文： | 吴卫江,王智广,张晶.两个经典频繁子图挖掘算法的对比与分析[J].内蒙古师范大学学报(自然科学版),2009,38(2). |
| |
| 作者姓名： | 吴卫江 王智广 张晶 |
| |
| 作者单位： | 中国石油大学(北京)计算机科学与技术系,北京,102200
|
| |
| 基金项目： | 国家自然科学基金，中国石油(CNPC)石油科技中青年创新基金 |
| |
| 摘 要： | AGM算法和HSIGRAM算法是两个经典的频繁子图挖掘算法,在基于图的数据挖掘中有重要的应用.从算法思想和应用技术两个方面分析了AGM算法和HSIGRAM算法的异同点,结合基于图的数据挖掘的特性,提出针对这两个算法的改进策略.
|
| 关 键 词： | 频繁子图挖掘算法 AGM算法 HSIGRAM算法 改进策略 |
Comparison and Analysis of Two Typical Frequent Subgraph Mining Algorithms |
| |
| WU Wei-jiang,WANG Zhi-guang,ZHANG Jing.Comparison and Analysis of Two Typical Frequent Subgraph Mining Algorithms[J].Journal of Inner Mongolia Normal University(Natural Science Edition),2009,38(2). |
| |
| Authors: | WU Wei-jiang WANG Zhi-guang ZHANG Jing |
| |
| Institution: | Department of Computer Science and Technology;China University of Petroleum;Beijing 102200;China |
| |
| Abstract: | AGM algorithm and HSIGRAM algorithm are two typical frequent subgraph mining algorithms.They have important influence on graph-based data mining.These two algorithms are introduced briefly in this paper.The differences and similarities of these algorithms are analyzed from two aspects of algorithm idea and technology.Combined with the characteristics of graph-based data mining,the improved strategies of these two algorithms are proposed. |
| |
| Keywords: | frequent subgraph mining algorithm AGM algorithm HSIGRAM algorithm improved strategy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
