An Efficient Algorithm for Mining Frequent Patterns in Data Stream

被引:0
|
作者
Zhang Guang-lu [1 ]
Lei Jing-sheng [2 ]
机构
[1] Hainan Namal Univ, Coll Math & Stat, Hainan Haikou, Peoples R China
[2] Nanjing Univ Post & Telecommun, Coll Comp Sci, Nanjing, Jiangsu, Peoples R China
关键词
frequent pattern; Data stream; DSMFP_LW algorithm;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Data stream with the expanding applications; mining frequent pattern over data stream has gradually become the field of data mining research in the core issue of research. Based on the study and to studying the improving the Proposed algorithm of Paper [3] .a new single-pass algorithm, Data Stream Mining for Frequent Pattern based on Land Window,is proposed,called DSMFP_LW. DSMFP_LW has major features as follows : namely single streaming data scan for counting pattern's information, extended prefix-tree-based compact pattern representation,and Incremental update of data The results of experiments shows that DSMFP_LW Algorithm have better utilization of time and space efficiency. In addition, outperforms the well-known algorithm Lossy Counting in the same streaming environment.
引用
收藏
页码:160 / +
页数:3
相关论文
共 9 条
  • [1] [Anonymous], 2000, SIGMOD INT WORKSHOP
  • [2] Giannella C., 2003, Next Gener. Data Min, V212, P191
  • [3] HAN JW, 2001, MICHELINE KAMBER ED, P150
  • [4] JIN R, 2005, 5 IEEE INT C DAT MIN, P22
  • [5] LI GH, 2008, J CHINESE COMPUTER S, V29
  • [6] [刘学军 Liu Xuejun], 2006, [计算机研究与发展, Journal of Computer Research and Development], V43, P1738, DOI 10.1360/crad20061010
  • [7] [刘学军 Liu Xuejun], 2005, [计算机研究与发展, Journal of Computer Research and Development], V42, P2192, DOI 10.1360/crad20051224
  • [8] Manku G.S., 2002, P 13RD INT C VERY LA, P346
  • [9] Pasquier N, 1999, LECT NOTES COMPUT SC, V1540, P398