Verifying and Mining Frequent Patterns from Large Windows over Data Streams

  • Authors:

  • Barzan Mozafari;Hetal Thakkar;Carlo Zaniolo

  • Affiliations:

  • Computer Science Department, University of California, Los Angeles, CA, USA. barzan@cs.ucla.edu;Computer Science Department, University of California, Los Angeles, CA, USA. hthakkar@cs.ucla.edu;Computer Science Department, University of California, Los Angeles, CA, USA. zaniolo@cs.ucla.edu

  • Venue:
  • ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a novel verification algorithm which we then use to improve the performance of monitoring and mining tasks for association rules. Thus, we propose a frequent itemset mining method for sliding windows, which is faster than the state-of-the-art methods - in fact, its running time that is nearly constant with respect to the window size entails the mining of much larger windows than it was possible before. The performance of other frequent itemset mining methods (including those on static data) can be improved likewise, by replacing their counting methods (e.g., those using hash trees) by our verification algorithm.