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

增量关联规则的向量法挖掘 被引量：1

Incremental Updating Algorithm for Mining Association Rules with Vector
下载PDF
导出
摘要 该文针对数据库记录增加时,如何高效地挖掘频集,提出了VFUP算法,并和其他增量更新算法进行比较,说明了该算法的高效性。 This paper proposes a new method of VFUP for how to mine frequent itemsets efficiently when increasing the number of records in database.The paper compares this new method with other incremental updating algorithms ,and proves the new method's property of high efficiency.
作者 伊卫国 卫金茂 王名扬
机构地区 东北师范大学计算智能研究所
出处 《计算机工程与应用》 CSCD 北大核心 2004年第32期181-183,共3页 Computer Engineering and Applications
关键词 关联规则 数据挖掘 向量法 增量更新 association rule,data mining,vector,incremental updating
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献11

  • 1李哲,杨兆中,庞炳章.大型数据库中关联规则的向量法挖掘[J].计算机工程,2003,29(8):97-99. 被引量：7
  • 2David W Cheung,jiawi Han,Vincent T Ng et al. 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,Louisiana,1996:06～114
  • 3陈劲松,施小英.一种关联规则增量更新算法[J].计算机工程,2002,28(7):106-107. 被引量：27
  • 4朱玉全,孙志挥.一种有效的关联规则增量式更新算法[J].计算机工程与应用,2001,37(23):28-29. 被引量：8
  • 5Agrawal R,Strikant R.Fast Algorithm for Mining Association Rules [C].In:Proceedings of the 20th VLDB Conference,Santiago,Chile,1994: 2472
  • 6Mannila H ,Toibonen H ,InkeriVerkam oA.Efficient Algorithms for discovering association rules[C].In:Proceedings of AAAI workshop on Knowledge Discovery In Database, 1994-08:181 ～192
  • 7Park 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
  • 8周皓峰,朱扬勇,施伯乐.一个基于兴趣度的关联规则采掘算法[J].计算机研究与发展,2002,39(4):450-457. 被引量：50
  • 9Klemettinen M,Mannila H,Ronkainen P et al.Finding interesting rules from large sets of discovered association rules[C].In:Proc of the Third Int'l Confon Information and Knowledge Management,Gaithursberg, Maryland, 1994: 401 ～407
  • 10Aggarwal C C,Yu P S.Online generation of association rules[C].In:Proc of the Int'l Confon on Data Engineering,Orlando,florida, 1998:402～411

二级参考文献12

  • 1左万利 刘居正.包含正负属性的关联规则及其挖掘.第十六届全国数据库学术会议论文集[M].兰州,1999.288-292.
  • 2[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
  • 3[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
  • 4[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
  • 5Show-Jane Yen,Arbee L. P. Chen Member.A Graph-based Approach for Discovering Various Types,of Association Rules.IEEE Trans. Knowledge and Data Eng.,2001,13(5).
  • 6Aumann Y.Borders:An Efficient Algorithm for Association Generation in Dynamic Data Bases. Intelligent Information Systems, 1999:61.
  • 7Carter C L,Hamilton H J.Efficient Attribute-oriented Algorithms for Knowledge Discovery from Large Database.IEEE Trans.Knowledge and Data Eng., 1998,10(2): 193-208.
  • 8Fukuda T.Data Mining with Optimized 2-Dimensional Association Rules.ACM Trans.on Database Systems,2001,26(2).
  • 9Hiriji K K.Exploring Data Mining Implementation.Communications of the ACM,2001,44(7).
  • 10Han Jiawei，Proc 2000 ACMSIGMOD Int Conference Management of Data，2000年，1页

共引文献85

同被引文献9

  • 1伊卫国,卫金茂,王名扬.基于项目集加权的增量关联规则算法研究[J].计算机工程与应用,2004,40(34):192-194. 被引量：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

计算机工程与应用
2004年 第32期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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