期刊文献+

两个经典频繁子图挖掘算法的对比与分析 被引量:1

Comparison and Analysis of Two Typical Frequent Subgraph Mining Algorithms
下载PDF
导出
摘要 AGM算法和HSIGRAM算法是两个经典的频繁子图挖掘算法,在基于图的数据挖掘中有重要的应用.从算法思想和应用技术两个方面分析了AGM算法和HSIGRAM算法的异同点,结合基于图的数据挖掘的特性,提出针对这两个算法的改进策略. AGM algorithm and HSIGRAM algorithm are two typical frequent subgraph mining algo rithms. 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.
出处 《内蒙古师范大学学报(自然科学汉文版)》 CAS 2009年第2期167-170,共4页 Journal of Inner Mongolia Normal University(Natural Science Edition)
基金 国家自然科学基金资助项目(60473125) 中国石油(CNPC)石油科技中青年创新基金资助项目(05E7013)
关键词 频繁子图挖掘算法 AGM算法 HSIGRAM算法 改进策略 frequent subgraph mining algorithm AGM algorithm HSIGRAM algorithm improved strategy
  • 相关文献

参考文献11

  • 1Kuramochi M,Karypis G. Finding frequent patterns in a large sparse graph [J]. Data Mining and Knowledge Discovery, 2005,11(3) :243-271.
  • 2Inokuchi A,Washio T,Motoda H. An apriori-based algorithm for mining frequent substructures from graph data [C]// Djamel A Zighed, Henryk Jan Komorowski,Jan M Zytkow. Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery. London: UK, Springer-Verlag, 2000 : 13-23.
  • 3李玉华,罗汉果,孙小林.一种基于Apriori思想的频繁子图发现算法[J].计算机工程与科学,2007,29(4):84-87. 被引量:5
  • 4周旭东,王丽爱,陈崚.启发式算法求解最大团问题研究[J].计算机工程与设计,2007,28(18):4329-4332. 被引量:10
  • 5Agrawal R,Imielinski T,Swanmi A. Mining association rules between sets of items in large database [C]// Proe of the ACM SIGMOD Conference on Management of Data. Washington DC:SIGMOD, 1993,207-216.
  • 6Jiawei Han.Michaeline Kamber.数据挖掘概念与技术[M].北京:机械工业出版社,2004
  • 7胡作霆,董兰芳,王洵.图的数据挖掘算法研究[J].计算机工程,2006,32(3):76-78. 被引量:8
  • 8Washio T, Motoda H. State of the Art of Graph-based Data Mining [J]. ACM SIGKDD Explorations Newsletter,2003, 5(1):59-68.
  • 9Akihiro Inokuchi,Takashi Washio, Hiroshi Motoda. Complete Mining of Frequent Patterns from Graphs: Mining Graph Data[J]. Machine Learing,2003,50:321-354.
  • 10吴卫江,李国和.顶点编码方法对最大团算法影响的研究[J].计算机工程与应用,2008,44(3):173-174. 被引量:1

二级参考文献34

共引文献41

同被引文献5

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部