This paper presents a single pass algorithm for mining discriminative Itemsets in data streams using a novel data structure and the tilted-time window model. Discriminative Itemsets are defined as Itemsets that are frequent in one data stream and their frequency in that stream is much higher than the rest of the streams in the dataset. In order to deal with the data structure size, we propose a pruning process that results in the compact tree structure containing discriminative Itemsets. Empirical analysis shows the sound time and space complexity of the proposed method.
CITATION STYLE
Seyfi, M., Geva, S., & Nayak, R. (2014). Mining discriminative itemsets in data streams. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8786, 125–134. https://doi.org/10.1007/978-3-319-11749-2_10
Mendeley helps you to discover research relevant for your work.