Mining Approximate Frequency Itemsets over Data Streams Based on D-Hash Table

Abstract

Frequent itemsets (or frequent pattern) mining, which is the basic step during data stream mining, has been paid more and more attention by researchers. Because of the uncertainties and continuities of data stream, the time-efficiency and space-efficiency of many mining algorithms are unaccepted. In this paper, hashed table is introduced to represent the… (More)
DOI: 10.1109/SNPD.2009.29

Topics

5 Figures and Tables

Slides referencing similar topics