期刊文献+

基于加权滑动窗口的数据流频繁项集挖掘算法 被引量:3

The Data Stream Frequent Itemsets Mining Algorithm Based on Weighted Sliding Window
下载PDF
导出
摘要 已有的滑动窗口数据流模型没有考虑过时数据和事务数量对挖掘结果的影响.针对该问题.提出了一种新的动态权值滑动窗口的数据流模型,并将该模型应用于数据流频繁项集挖掘中,设计了动态权值滑动窗口的频繁项集挖掘算法FIMDWS和改进算法FIMDWSW-Imp.通过实验对算法做了分析和评价. In the existing literatures,sl iding window models does not consider the mining effect of outdated data and the num-ber of transactions. To solve this problem,this paper proposes a novel dynamic weighted sliding window data stream model. Firstly, we apply this model to the data stream frequent itemsets mining,and design and presents the algorithms of FIMDWSW( Frequent Itemsets Mining in Dynamic Weighted Sliding Window) and imporved FIMDWSW - IMP (Frequent Itemsets Mining in Dynamic Weighted Sliding Window - Improvment) for dynamic weighted sliding window data stream model. The performance of algorithms are analyzed and evaluated in numerical experiments.
作者 白川平 杨志翀 BAI Chuanping;YANG Zhichong(School of Mathematics and Computer Science,Ningxia Normal University, Guyuan Ningxia 756000;School of Electronic and Information Engineering,Lanzhou Jiaotong University, Lanzhou Gansu 730070)
出处 《宁夏师范学院学报》 2017年第6期49-55,共7页 Journal of Ningxia Normal University
基金 宁夏自然科学基金资助项目(NZ15264) 甘肃省教育厅高等学校科研经费项目(2017A-027) 甘肃省自然科学基金项目(1506RJZA072)
关键词 数据流 频繁项集 权值滑动窗口 Data stream Frequent item sets Weighted sliding window
  • 相关文献

参考文献2

二级参考文献27

  • 1刘殷雷,刘玉葆,陈程.不确定性数据流上频繁项集挖掘的有效算法[J].计算机研究与发展,2011,48(S3):1-7. 被引量:14
  • 2Han J, Kamber M. Data Mining Concepts and Techniques [ M ]. Mor- gan Kaufmann, San Francisco, 2006.
  • 3Manku G S. Motwani R (2002) Approximate frequency counts over data streams[ C ]//Proceedings of the 28th international conference on very large data bases, Hong Kong, 2002:346- 357.
  • 4Giannella C, Han J, Pei J, et al. Mining frequent patterns in data streams at multiple time granularities [ C ]//Data Mining: Next Genera- tion Challenges and Future Directions, AAAI/MIT Press, 2004 ( Chapter 6 ).
  • 5Chi Y, Wang H, Yu P, et al. (2004) Moment: maintaining closed frequent itemsets over a stream sliding window [ C ]//Proceedings of the 4th IEEE international conference on data mining, Brighton, UK, 2004,59 - 66.
  • 6Leung C K S, Khan Q I. DSTree : a tree structure for the mining of fre- quent sets from data streams[ C ]//Proc. ICDM, 2006:928 - 932.
  • 7Syed khairuzzaman. Sliding window-based frequent pattern mining over data streams [ C ]. 2009 Information Sciences 179 ,2009 : 3843 - 3865.
  • 8Yuh-Jiuan Tsay, Tain-Jung Hsu, Jing-Rung Yu. FIUT: A new method for mining frequent itemsets [ J ]. Information Sciences, 2009 : 1724 - 1737.
  • 9Tanbeer S K, Ahmed C F, Jeong B S, et al. CP-tree: a tree structure" for single-pass frequent pattern mining [ C ]//Proc. PAKDD, 2008 : 1022 - 1027.
  • 10Blake C L, Merz C J. UCI Repository of Machine Learning Databases [D]. University of California-Irvine, Irvine, CA, 1998.

共引文献14

同被引文献23

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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