DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams

  • Authors:
  • Carson Kai-Sang Leung;Quamrul I. Khan

  • Affiliations:
  • The University of Manitoba, Canada;The University of Manitoba, Canada

  • Venue:
  • ICDM '06 Proceedings of the Sixth International Conference on Data Mining
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

With advances in technology, a flood of data can be produced in many applications such as sensor networks and Web click streams. This calls for efficient techniques for extracting useful information from streams of data. In this paper, we propose a novel tree structure, called DSTree (Data Stream Tree), that captures important data from the streams. By exploiting its nice properties, the DSTree can be easily maintained andmined for frequent itemsets as well as various other patterns like constrained itemsets.