期刊文献+

频繁序列模式更新算法 被引量:2

Algorithm for updating frequent sequential patterns
下载PDF
导出
摘要 在分析了频繁序列模式更新算法关键技术的基础上,提出了一种快速的增量式更新频繁序列模式挖掘算法FUFSPA,该算法将充分利用先前挖掘过程中所产生的信息来减少本次挖掘过程中的时间开销.另外,针对频繁序列模式挖掘中支持数计算的复杂性,提出了一种基于二进制形式的支持数计算方法,该方法只需进行一些“或”逻辑运算操作,将该方法用于序列模式挖掘中支持度(数)的计算,可以进一步提高算法的执行效率.实验结果表明算法FUFSPA是可行和有效的. The key technique of updating frequent sequential patterns is studied. An incremental updating algorithm, FUFSPA, for mining frequent sequential patterns is presented, which makes use of information collection during an earlier mining process to cut down the cost of mining new sequential patterns in the updated database. Meanwhile, in order to solve the complexity of counting the support in mining frequent sequential patterns, an efficient method to calculate the support is proposed, which only executes some logical operation. The experiments show that the algorithm FUFSPA is efficient.
出处 《江苏大学学报(自然科学版)》 EI CAS 北大核心 2007年第3期250-253,共4页 Journal of Jiangsu University:Natural Science Edition
基金 国家自然科学基金资助项目(60572112)
关键词 数据挖掘 频繁项目集 序列模式 增量式更新 关联规则 data mining frequent itemsets sequential pattern incremental updating association rules
  • 相关文献

参考文献10

二级参考文献36

  • 1宋余庆,王立军,吕颖,谢从华.基于分类树的高效关联规则挖掘算法[J].江苏大学学报(自然科学版),2006,27(1):51-54. 被引量:6
  • 2Jhan M Kamber著 范明 孟小峰等译.数据挖掘:概念与技术[M].北京:机械工业出版社,2001..
  • 3[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
  • 4[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
  • 5[3]Han J, Kamber M. Data Mining: Concepts and Techniques. Beijing: Higher Education Press, 2001
  • 6[5]Agrawal R, Shafer J C. Parallel mining of association rules:Design, implementation, and experience. IBM Research Report RJ 10004,1996
  • 7[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
  • 8[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
  • 9[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
  • 10[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

共引文献131

同被引文献17

  • 1蒙韧,苏毅娟,朱晓峰,张继连.数据挖掘中的增量式关联规则更新算法[J].广西科学院学报,2006,22(2):125-128. 被引量:4
  • 2[加]HAN J,KAMBER M.数据挖掘概念与技术[M].范明,孟小峰,译.北京:机械工业出版社,2007.
  • 3AGRAWAL R, IMtELINSKI T, SWAMI A. Mitring association rules between sets of items in large databases [ C]// Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. New York: ACM, 1993:207-216.
  • 4CHEUNG D W, HAN J, NG V, et al. Maintenance of discovered association ruales in large databases: An incremental updating technique [ C] // Proceedings of the Twelfth International Conference on Data Engineering, Washington: IEEE Computer Society, 1996:106 - 114.
  • 5CHEUNG D W, LEE S D, KAO B. A general incremental technique for maintaining discovered association rules [ C]//DASFAA: Proceedings of the Fifth Interuational Conference on Database Systems for Advanced Applications. [ S. l. ] : World Scientific Press, 1997:185 - 194.
  • 6CHANG H L, CHENG R L, MING S C. Sliding window filter: An efficient method for incremental mining on a time-variant database [J]. Information Systems, 2005, 30(3): 227-244.
  • 7ELFANGARY, ATTEYA L, ADLY W. Mining medical database using Proposed Incremental Association role algorithm (PIA) [ C]// Second Intematianal Conference on the Digital Society. Washington: IEEE, 2008:88-92.
  • 8TANSEL A U IMBERMAN S P. Discovery of association rules in temporal database [ C]//ITNG'07: International Conference on Information Technology. Washington: IEEE Computer Society, 2007:371-376.
  • 9AMORNCHEWIN R, KREESURADEJ W. Incremental association rule mining using promising frequent itemnset algorithm [ C]// 6th International Conference on Information, Communication & Siqnal Processing. Washington: IEEE, 2007:1-5.
  • 10朱玉全,宋余庆.频繁闭项目集挖掘算法研究[J].计算机研究与发展,2007,44(7):1177-1183. 被引量:10

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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