Mining frequent patterns in a varying-size sliding window of online transactional data streams

  • Authors:

  • Hui Chen;Lihchyun Shu;Jiali Xia;Qingshan Deng

  • Affiliations:

  • School of Software and Communication Engineering, Jiangxi University of Finance and Economics, Nanchang, China;College of Management, National Cheng Kung University, Taiwan, ROC and College of Information and Engineering, Chang Jung Christian University, Taiwan, ROC;School of Software and Communication Engineering, Jiangxi University of Finance and Economics, Nanchang, China;School of Software and Communication Engineering, Jiangxi University of Finance and Economics, Nanchang, China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 0.07

Visualization

Abstract

In some data stream applications, the information embedded in the data arriving in the most recent time period is of particular interest. This paper proposes a method for efficiently mining the frequent patterns in a varying-size sliding window of online data streams. To highlight recent frequent patterns in the data stream, a time decay model is used to differentiate the patterns of recently generated transactions from historical transactions. The derived concrete bounds of the decay factor can achieve either 100% recall or 100% precision. A summary data structure, named SWP-tree, is proposed for capturing the content of the transactions in the sliding window by scanning the stream only once. In order to speed up online processing of new transactions, the information of frequent patterns recorded in the SWP-tree is updated in an incrementally way. To make the mining operation efficient, the SWP-tree is periodically pruned by identifying insignificant patterns, which include two kinds of obsolete pattern and two kinds of infrequent pattern. Since the sliding window can change its size, the effect of window size is examined. The performance of the proposed technique is evaluated via simulation experiments. The results show that the proposed method is both efficient and scalable, and that it outperforms comparable algorithms.