期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种基于前缀节点的频繁子图挖掘算法

Frequent subgraphs mining algorithm based on prefix node
下载PDF
导出
摘要 基于频繁子树挖掘算法中的前缀节点思想,将模式图分为图核—分支—连接向量三个部分,提出了CBE算法。对在分支上扩展得到的候选模式图,CBE算法能够在常数时间内完成规范化判定。通过实验证明CBE算法的子图挖掘效率有显著提高。 Based on the prefix node method in frequent tree mining algorithms,adopting core-braches-connecting vector partition on graphs,this paper provided a new algorithm CBE.The CBE algorithm could accomplish canonical determining in constant time on candidate pattern graphs expanded from branches.Performance testing proves that the efficiency of subgraphs mining is improved by CBE algorithm.
作者 李海波 王元珍
机构地区 华中科技大学计算机科学与技术学院多媒体与数据库研究所
出处 《计算机应用研究》 CSCD 北大核心 2010年第7期2476-2478,2482,共4页 Application Research of Computers
关键词 数据挖掘 频繁子图 同构类 规范化形式 前缀节点 data mining frequent subgraph isomorphism class canonical form prefix node
分类号 TP301 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献11

  • 1李先通,李建中,高宏.一种高效频繁子图挖掘算法[J].软件学报,2007,18(10):2469-2480. 被引量：35
  • 2周杨,王峰.FSM--基于子图同构和结构同构的频繁子图挖掘算法[C] //第二十四届中国数据库学术会议.2007:296-301.
  • 3AGRAUAL R,STRIKAUT R.Fast algorithm for mining association rule in large databases[C] //Proc of the 20th International Conference on Very Large Data Bases.1994:487-499.
  • 4INOKUCHI A,WASHIO T,MOTODA H.An apriori-based algorithm for mining frequent substructures from graph data[C] //Proc of the 4th European Conference on Principle of Data Mining and Knowledge Discovery.London:Springer-Verlag,1998:13-23.
  • 5NIJSSEN S,KOK J.A quickstart in frequent structure mining can make a difference[C] //Proc of ACM SIGKDD of International Conference on Knowledge Discovery and Data Mining.2004:647-652.
  • 6CHI Yun,MUNTZ R R,NIJESSN S,et al.Frequent subtree mining an overview[J].Fundamenta Infomaticae:Special Issue on Graph & Tree Mining,2005,66(1-2):161-198.
  • 7KURAMOCHI M,KARYPIS G.Frequent subgraph discovery[C] //Proc of International Conference on Data Mining.San Jose:[s.n.] ,2001:313-320.
  • 8YAN Xi-feng,HAN Jia-wei.gSpan:graph-based substructure pattern mining[C] //Proc of the 2nd International Conference on Data Mining.Maebashi:[s.n.] ,2002:721-724.
  • 9YAN Xi-feng,HAN Jia-wei.Close graph:mining closed frequent graph patterns[C] //Proc of ACM SIGKDD of International Conference on Knowledge Discovery and Data Mining.Washington DC:[s.n.] ,2003:24-27.
  • 10Jia-WeiHan,JianPei,Xi-FengYan.From Sequential Pattern Mining to Structured Pattern Mining： A Pattern-Growth Approach[J].Journal of Computer Science & Technology,2004,19(3):257-279. 被引量：18

二级参考文献54

  • 1Wang J, Chirn G, Marr T, Shapiro B, Shasha D,Zhang K. Combinatorial pattern discovery for scientific data: Some preliminary results. In Proc. 1994 ACM-SIGMOD Int. Conf. Management of Data(SIGMOD'94), Minneapolis, MN, May, 1994, pp.115-125.
  • 2Bettini C, Wang X S, Jajodia S. Mining temporal relationships with multiple granularities in time sequences.Data Engineering Bulletin, 1998, 21: 32-38.
  • 3Zaki M J. Efficient enumeration of frequent sequences.In Proc. 7th Int. Conf. Information and Knowledge Management (CIKM'98), Washington D.C., Nov. 1998,pp.68-75.
  • 4Masseglia F, Cathala F, Poncelet P. The psp approach for mining sequential patterns. In Proc. 1998 European Symp. Principle of Data Mining and Knowledge Discovery (PKDD'98), Nantes, France, Sept. 1998, pp.176-184.
  • 5Lu H, Han J, Feng L. Stock movement and n-dimensional inter-transaction association rules. In Proc.1998 SIGMOD Workshop Research Issues on Data Mining and Knowledge Discovery (DMKD'98), Seattle,WA, June 1998, pp.12:1-12:7.
  • 6Agrawal R, Srikant R. Mining sequential patterns. In Proc. 1995 Int. Conf. Data Engineering (ICDE'95),Taipei, Taiwan, Mar. 1995, pp.3-14.
  • 7Srikant R, Agrawal R. Mining sequential patterns:Generalizations and performance improvements. In Proc. 5th Int. Conf. Extending Database Technology(EDBT'96), Avignon, France, Mar. 1996, pp.3-17.
  • 8Mannila H, Toivonen H, Verkamo A I. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1997, 1: 259-289.
  • 9Ozden B, Ramaswamy S, Silberschatz A. Cyclic association rules. In Proc. 1998 Int. Conf. Data Engineering(ICDE'98), Orlando, FL, Feb. 1998, pp.412-421.
  • 10Han J, Dong G, Yin Y. Efficient mining of partial periodic patterns in time series database. In Proc. 1999 Int.Conf. Data Engineering (ICDE'99), Sydney, Australia,April 1999, pp.106-115.

共引文献51

计算机应用研究
2010年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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