期刊文献+

基于互关联后继树的频繁模式挖掘研究 被引量:2

Frequent Patterns Mining Algorithm Based on IRST
下载PDF
导出
摘要 关联规则挖掘是数据挖掘的一个重要的研究内容,而产生频繁模式集是关联规则挖掘的第1步工作。很多传统的频繁模式挖掘算法都需要产生候选模式集,因而效率很低。该文提出了一种不需要产生候选集,而直接构造频繁集的频繁模式挖掘算法——基于互关联后继树的频繁模式挖掘算法。实验证明,该算法具有较好的性能。 An important subject of data mining is association rules mining, of which the first step is to generate frequent patterns. A lot of traditional algorithms need candidate items to generate frequent patterns, so they are inefficient. In this paper, a mining algorithm which does not generate candidate items is put forward. It is based on inter-relevant successive trees. Experiments show it is efficient.
出处 《计算机工程》 CAS CSCD 北大核心 2004年第21期30-32,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60173027)
关键词 关联规则 频繁模式挖掘 互关联后继树模型 数据挖掘 Association rules Frequent patterns mining Inter-relevant successive tree(IRST)
  • 相关文献

参考文献3

  • 1[1]Han J, Pei J, Yi Y. Mining Frequent Patterns Without Candidate Generation. Proc. of 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD' 00), 2000:1-12
  • 2[2]Han J, Pei J. Mining Frequent Patterns by Pattern-Growth: Methodology and Implications. ACM SIGKDD Explorations (Special Issue on Scaleble Data Mining Algorithms), 2000, 2(2): 14-20
  • 3[3]Agrawal R, Srikant R. Fast Algorithms for Mining Association Rules.Proc. ofInt. Conf. on Very Large Data Bases, 1994:487-499

同被引文献9

  • 1谢祖彬,朱建国,褚海燕,张雅丽,高人,曾青,曹志洪.分根法研究镧对水稻生长及其生理参数的影响[J].中国稀土学报,2003,21(1):71-76. 被引量:17
  • 2Mobasher B, Jain N, Han E H. Web mining: Pattern discovery from world wide web transae-tions [ R ]. University of Minnesota Minneapolis: Department of Computer Science, 1996, Technical Report TR-96050.
  • 3AgrawalR, SrikantR. Miningsequentialpatterns [ C ]//Proc of IntConf Data Engineering. Taipei : IEEE Computer Society, 1995:3 - 14.
  • 4Wahid P A, Valiathan M S, Kamalam N V, et al. Effect of rare earth elements on growth and nutrition of coconut palm and root competition for these elements between the palm and calotropis gigantean [J]. Journal of Plant Nutrition, 2000, 23(3): 329.
  • 5胡运发..互关联后继树-一种新型全文教据库教学模型.CIT-02-03[R]..上海:复旦大学,,2002....
  • 6STOLORZ P, MUSICK R. Scalable high performance computing forknowledge discovery and data mining[ M ]. [ S. l. ] :Kluwer Academic Publishers, 1997.
  • 7肖立英,李建华,谭立球.Web日志挖掘技术的研究与应用[J].计算机工程,2002,28(7):276-277. 被引量:21
  • 8曾海泉,胡勤友,周水庚,胡运发.基于互关联后继树的时序模式挖掘[J].模式识别与人工智能,2003,16(3):299-305. 被引量:4
  • 9江宝林,张川,申展,葛家翔,胡运发.基于互关联后继树的Web日志挖掘技术[J].计算机应用与软件,2004,21(5):9-11. 被引量:2

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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