期刊文献+

基于数据库变化的关联规则增量式更新算法 被引量:1

Incremental Updating Algorithm for Mining Association Rules Based on Database
下载PDF
导出
摘要 发现频繁项目集是关联规则数据挖掘中的关键问题。随着数据集的增减,就会产生不同的频繁项目集。在数据集变化情况下频繁项目集的快速高效更新问题仍亟待解决。 Discovering frequent itemsets is important in data mining association rules.With the addition and subtraction of the data sets,there are different frequent itemsets.It attemps to looking for a solution to solve the problem that maintains the renewal of frequent itemsets fastly and efficiently under the variance of data sets.
作者 徐龙 杨君锐
机构地区 西安科技大学
出处 《重庆科技学院学报(自然科学版)》 CAS 2007年第4期67-70,共4页 Journal of Chongqing University of Science and Technology:Natural Sciences Edition
关键词 数据挖掘 关联规则 增量更新 频繁项目集 data mining association rules incremental updating frequent itemsets.
  • 相关文献

参考文献7

  • 1朱玉全,孙志挥,季小俊.基于频繁模式树的关联规则增量式更新算法[J].计算机学报,2003,26(1):91-96. 被引量:80
  • 2李雄飞,刘光远,郭励焕,苑森淼,侯天伦.二次挖掘相联规则算法[J].吉林大学学报(工学版),2002,32(2):73-77. 被引量:6
  • 3[4]Agrawa Lr.Imielinski T,Swami A.Mining Association Rules Between Sets of Items in Large Databases[C].In:Buneman P,Jajodia S,eds.Proc.of the ACM SIGMOD Conf.on Management of Data (SIGMOD'93).New York:ACM Press,1993.207-216.
  • 4[5]Agrawal R.Srikant R.Fast Algorithms for Mining Association Rules[C].Proceedings of the 20th Int'l Conference on Very Large Databases,Santiago,1994,487-499.
  • 5冯玉才,冯剑琳.关联规则的增量式更新算法[J].软件学报,1998,9(4):301-306. 被引量:227
  • 6[7]Han J,etal.Mining Frequent Patterns Without Candidate Generation[C].In:Proceedings of SIGMOD 2000,Dallas,TX.America.2000.
  • 7[1]Han J,Kamber M.Data Mining:Concepts and Techniques[M].北京:高等教育出版,2001:6-7.

二级参考文献12

  • 1[1]Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD International Conference on Management of Date, Washington DC, 1993.207~216
  • 2[2]Agrawal R, Srikant R. Fast algorithm for mining association rules. In: Proceedings of the 20th International Conference on VLDB, Santiago, Chile, 1994. 487~499
  • 3[3]Han J, Kamber M. Data Mining: Concepts and Techniques. Beijing: Higher Education Press, 2001
  • 4[5]Agrawal R, Shafer J C. Parallel mining of association rules:Design, implementation, and experience. IBM Research Report RJ 10004,1996
  • 5[6]Savasere A, Omiecinski E, Navathe S. An efficient algorithm for mining association rules. In: Proceedings of the 21th International Conference on VLDB, Zurich, Switzerland, 1995. 432~444
  • 6[7]Hah J, Jian P et al. Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD International Conference on Management of Data, Dallas, TX, 2000.1~12
  • 7[8]Cheung D W, Lee S D, Kao B. A general incremental technique for maintaining discovered association rules. In: Proceedings of databases systems for advanced applications, Melbourne, Australia, 1997. 185~194
  • 8[10]Han J, Jian P. Mining access patterns efficiently from web logs. In: Proceedings of Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'00), Kyoto, Japan,2000. 396~407
  • 9[11]Agrawal R, Srikant R. Mining sequential pattern. In: Proceedings of the 11th International Conference on Data Engineering, Taipei, 1995. 3~14
  • 10冯玉才,冯剑琳.关联规则的增量式更新算法[J].软件学报,1998,9(4):301-306. 被引量:227

共引文献282

同被引文献13

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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