期刊文献+

基于项目集加权的增量关联规则算法研究 被引量:1

Research of Incremental Updating Algorithm for Mining Association Rules with Items Weightedg Universi
下载PDF
导出
摘要 针对最小支持度,最小置信度不变的情况下,新增数据库db时的关联规则更新问题,进行了分析和研究。考虑到新增数据库的新颖性、以及生成规则的有趣性等问题,本文提出了基于项目集加权的增量更新算法,并分析了其可行性。 In this paper,we discuss the problem of updating the association rules when increasing the database without changing the minimum support and the minimum confidence.Furthermore,we propose a new method of incremental updating algorithm after the items are weighted in view of the novelty of the increments of database,which validation is also analyzed here.
出处 《计算机工程与应用》 CSCD 北大核心 2004年第34期192-194,共3页 Computer Engineering and Applications
关键词 数据挖掘 关联规则 加权兴趣度 data mining,association rules,weighted-items,interest
  • 相关文献

参考文献5

二级参考文献12

  • 1[1]Agrawal R. Mining Association Rules Between Sets of Items in Large Database. Washington, DC:Proceedings of ACM SIGMOD Conference on Management of Data, 1993-05:207-216
  • 2[2]Agrawal R, Srikant R. Fast Algorithms for Mining Association Rules.Santiago, Chile: Proceedings of the 20th International Conference on Very Large Databases, 1994-09:487-499
  • 3[3]Cheung D W. Maintenance of Discovered Association Rules in Large Databases:An Incremental Updating Technique. New Orleans,Louisana:Proceedings of the 12th International Conference on Data Engineering,1996:106-114
  • 4Brin S,Motwanti R,Ullman J et al. Dynamic itemset counting and implication rules for market basket data[C].In:Proceedings of the Intemational Conference on Management of Data,1997:255~264
  • 5Brin S,Motwanti R,Silverstein C.Beyond market baskets:generalizing association rules to correlations[C].In:Proceedings of the ACM SIG MOD international Conference on Management of Data,1997:265~276
  • 6Agrawal R,ImielinSki T,Swami A.Mining association rules between sets of items in large database[C].Proceeding of the ACM SIGMOD International Conference on Management of Data, 1993:207~216
  • 7Agrawal R,Srikant R.Fast algorithm for mining association rules[C].In :Proceedings of the 1994 International Conference on Very Large Data Bases,Santiago,Chile: 1994:487~499
  • 8Han Jiawei,Proc 2000 ACMSIGMOD Int Conference Management of Data,2000年,1页
  • 9David W Cheung,Proc 12th Int Conference on Data Engineering,1996年,06页
  • 10冯玉才,冯剑琳.关联规则的增量式更新算法[J].软件学报,1998,9(4):301-306. 被引量:227

共引文献37

同被引文献9

  • 1伊卫国,卫金茂,王名扬.增量关联规则的向量法挖掘[J].计算机工程与应用,2004,40(32):181-183. 被引量:1
  • 2AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large databases [A]. Peter Buneman, Sushil Jajodia. Proc 1993 ACM SIGMOD Conference on Management of data, Washington, DC. 1993:207-216.
  • 3HAN J, PEI J, YIN Y. Mining frequent patterns without candidate generation [ C ]. In Proceedings of ACMSIGMOD International Conference on Management of Data, 1996:32-42.
  • 4AGRAWAL R, STRIKANT R. Fast Algorithm for Mining Association Rules [ C ]. In Proceedings of the 20th VLDB Conference, Santiago, Chile, 1994:24-72.
  • 5SAVASERE A, OMIECINSKI E, NAVATHE S. An efficient algorithm for mining association rules in large databases[ C ]. Proceedings of the 21st International Conference on Very large Database, 1995.
  • 6PARK J S, CHEN M S, YU P S. An effective hash - based algorithm for mining association rules [ C ]. In Proceedings of the ACM SIGMOD International Conference on Management of Data,1995:175-186.
  • 7周欣,沙朝锋,朱扬勇,施伯乐.兴趣度——关联规则的又一个阈值[J].计算机研究与发展,2000,37(5):627-633. 被引量:91
  • 8罗可,吴杰.怎样获得有效的关联规则[J].小型微型计算机系统,2002,23(6):711-713. 被引量:12
  • 9李哲,杨兆中,庞炳章.大型数据库中关联规则的向量法挖掘[J].计算机工程,2003,29(8):97-99. 被引量:7

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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