Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (5): 1235-1240.

Previous Articles     Next Articles

Online mining closed frequent itemsets over a stream sliding window

AO Fu-jiang1, DU Jing2, YAN Yue-jin2, HUANG Ke-di1   

  1. 1. Coll. of Mechanical Engineering and Automation, National Univ. of Defense Technology, Changsha 410073, China;
    2. School of Computer Science, National Univ. of Defense Technology, Changsha 410073, China
  • Received:2008-01-17 Revised:2008-06-24 Online:2009-05-20 Published:2010-01-03

Abstract: Online mining closed frequent itemsets in sliding window is one of the most important issues for mining data streams.A novel algorithm,FPCFI-DS,is proposed,which can efficiently mine closed frequent itemsets over a stream sliding window with limited memory space,and maintain exact closed frequent itemsets in current window at any time.For data in the first window,the algorithm FPCFI-DS mines closed frequent itemsets using single-pass procedure,denoted as FPCFI.The resulting closed frequent itemsets are stored in a global closed frequent itemsets tree(GCT).When the window slides forward,the FPCFI-DS quickly updates closed frequent itemsets in current window using the updating-mining method.The experimental results show that FPCFI-DS is superior to that of state-of-the-art algorithm Moment in terms of time and space efficiency.

CLC Number: 

[an error occurred while processing this directive]