期刊文献+

关联规则增量更新算法研究 被引量:10

Research of Association Rules Incremental Updating Algorithm
下载PDF
导出
摘要 该文研究了关联规则更新的第一类问题,即数据库记录增加时的关联规则更新问题。首先,该文讨论了现有的FUP算法的基本思想,然后在此基础上对其进行改进,提出了改进的FUP算法EFUP,给出了具体实现方法。最后在不同方面针对EFUP与FUP算法进行了实验比较,说明了EFUP相对于FUP算法的优点。 The article introduces some research work about the first type of association rules updating,that is,the asso-ciation rules updating problem when the database record increases.First,the article discusses the basic ideas of current FUP algorithm,then improves it on this basis,proposes an enhanced FUP algorithm EFUP,and presents the concrete process.Finally,some experiments show that EFUP is better than FUP at many aspects.
出处 《计算机工程与应用》 CSCD 北大核心 2002年第23期6-8,共3页 Computer Engineering and Applications
基金 部委科研项目资助
关键词 关联规则增量更新算法 数据挖掘 关联规则 频繁项集 支持数 候选项集 数据库 知识发现 Data Mining,Association Rules,Frequent Itemsets,Support Count ,Candidate Itemsets
  • 相关文献

参考文献5

  • 1[1]Agrawal R.Mining assoeiation rules between sets of items in large databases[C].In:Proceedings of ACM SIGMOD Conference on Management of Data,Washington,DC,/~kjqk, 1993-05: 207~216
  • 2[2]Agrawal R,Srikant R.Fast algorithms for mining association rules[C].In :Proceedings of the 20th International Conference on Very Large Databases, Santiago, Chinle, http://sinakdd. 163 .net/main .htm, 1994-09:487~499
  • 3[3]Srikant R,Agrawal R.Mining generalized association rules[C].In:Proceedings of the 21st International Conference on Very Large Databases,Zurich, Switzerland, 1994-09: 407~419
  • 4[4]Cheung D W.Maintenance of discovered association rules in large databases:an incremental updating technique[C].In :Proceedings of the 12th International Conference on Data Engineering,New Orleans,Louisana, http://www.cs.sfu.ca/~han/, 1996:106~114
  • 5[5]S D Lee,David W Cheung. Maintenance of Discovered Association Rules:When to Update?[C].In:Workshop on Research Issues on Data Mining and Knowledge Discovery(DMKD),Tucson,Arizona, 1977-05

同被引文献78

  • 1胡世昌,李劲华,王常颖.基于二进制编码的Apriori改进算法[J].计算机应用研究,2020,37(2):398-400. 被引量:16
  • 2章志刚,吉根林.基于迭代式MapReduce的Apriori算法设计与实现[J].华中科技大学学报(自然科学版),2012,40(S1):9-12. 被引量:8
  • 3张师超,张继连,陈峰,倪艾玲.负增量式关联规则更新算法[J].计算机科学,2005,32(9):153-155. 被引量:7
  • 4[1]D W Cheung,etc.Maintenance of Discovered Association Rules in Large Databases:An Incremental Updating Technique,Proceedings of the 12th International Conference on Data Engineering,New Orleans,Louisana(E),1996,106-114
  • 5[3]Agrawal R,Srikant R.Fast Algorithms for Mining Association Rules.Santiago,Chile:Proceedings of the 20th International Conference on Very Large Databases,1994.9,487-499
  • 6Hong T,Lin K,Chien B.Mining Fuzzy Multiple-level Association Rules from Quantiative Data[J].Applied Intelligence,2003,(18):79-90.
  • 7Wille R.Restructuring Lattice Theory:An Approach Based on Hierarchies of Concepts[C].Rival I(ed).Ordered Sets,Dordecht D Reidel Publishing Company,1982.445-470.
  • 8Missaoui R,Godin R.Extracting Exact and Approxiamte Ruler from Databases[A].A lagar V S,Bergler S,Dong F Q(Eds)[M].Incompleteness and Uncertainty in Information Systems[C].London:Springer-Verlag,1994.209-222.
  • 9Pasquier N,Bastide Y,et al.Discovering Frequent Closed Itemsets for Association Rules[C].Beeri C,et al,eds.the 7th Int'l.Conf.on Database Theory,Jerusalem:Springer-Verlag,1999.398-416.
  • 10Pei J,Han J,Mao R.CLOSET:An Efficient Algorithm for Mining Frequent Closed Itemsets[C].Gunopulos D,et al,eds.the 2000 ACM SIGMOD Int'l.Workshop on DMKD,Dallas:ACM Press,2000.21-30.

引证文献10

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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