期刊文献+

一种高效的关联规则增量式更新算法 被引量:4

An Efficient Incremental Updating Algorithm for Mining Association Rules
下载PDF
导出
摘要 提出一种基于垂直型数据格式的算法TMFUP,用来解决数据挖掘中数据库增加而最小支持度不变化时关联规则增量式更新问题.该算法只须扫描原始数据库和新增数据库一遍. This paper presents a algorithm TMFUP based on the vertical data format. The paper keeps the minsupport changeless when new transaction database dh is added to original database DB and generates the new association rules. This algorithm only takes one-scan on both the original database and the increased database.
出处 《微电子学与计算机》 CSCD 北大核心 2010年第9期56-60,共5页 Microelectronics & Computer
关键词 关联规则 增量式更新 垂直型数据格式 association rule incremental updating vertical data format
  • 相关文献

参考文献7

  • 1Agrawal R, Imielinski T, Swami A. Database mining: a performance perspective[J ]. IEEE Transactions on Knowledge and Data Engineering, 1993,5 (6) : 914 - 925.
  • 2Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in lager databases[ C]//Prcc. ACMSIGMOD International Conference. Management of Data. Washington, 13(2,1993 : 207 - 216.
  • 3Mohammed J Zaki, Ching - Jui Hsiao. Efficient algorithms for mining closed itemsets and their lattice structure[J ]. IEEE Transactions On Knowledge And Data Engineering, 2005,17(4) :462 - 478.
  • 4Jiawei Han,Micheline Kamber.数据挖掘概念与技术[M].北京:机械工业出版社,2008:148-154.
  • 5Agrawal R, Srikant R. Fast algorithm for mining association rules [ C ]//The 20th International Conference on VLDB. Santiago, Chile, 1994 : 487 - 499.
  • 6刘华婷,郭仁祥,姜浩.关联规则挖掘Apriori算法的研究与改进[J].计算机应用与软件,2009,26(1):146-149. 被引量:119
  • 7IBM. Computer science: intelligent information systems [EB/OL]. [2005 - 12 - 15]. http://www, ibm. corn/.

二级参考文献10

  • 1胡吉明,鲜学丰.挖掘关联规则中Apriori算法的研究与改进[J].计算机技术与发展,2006,16(4):99-101. 被引量:59
  • 2Chen M S,Han J W,Yu P S. Data Mining: An Overview from a Database Perspective[ J]. IEEE Transactions on Knowledge and Data Engineering, 1996,8 (6) : 866 - 883.
  • 3Han J W,Kamber M. Data Mining Concepts and Techniques[ M]. Beijing: Higher Education Press,2001.
  • 4Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases [ C ]. Proceedings of the 20th International Conference on Very Large Data Bases, September 1994.
  • 5Han E H, Karypis G, Kumar V. Scalable parallel data mining for association rules[ C ]. ACM SIGMOD International Conference on Management of Data, May, 1997.
  • 6Agrawa! R, Imielinski T, Swami A. Mining association rules between. sets of items in large databases[ C ]. Proceedings of the ACM SIGMOD International Conference on Management of Data ; May, 1993.
  • 7Wur S Y, Leu Y H. An effective Boolean algorithm for mining association rules in large databases [ C ]. Database Systems for Advanced Applications, 1999 : Proceedings, 6th International Conference, April, 1999:19 -21.
  • 8Li S, Hong S, Ling C. New algorithms for efficient mining of association rules [ C]. Proceedings of the 7^th Symposium on the Frontiers of Massively Parallel Computation, February, 1999.
  • 9Park J S,Chen M S,Yu P S. Using a hash-based method with transaction trimming for mining association rules[ J]. Knowledge and Data Engineering, IEEE Transactions 1997,9(5 ) : 813 - 825.
  • 10陈安,陈宁,周龙骧.数据挖掘技术与应用[M].北京:科学出版社,2006.

共引文献130

同被引文献28

引证文献4

二级引证文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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