Mining frequent itemsets over tuple-evolving data streams - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2013

Mining frequent itemsets over tuple-evolving data streams


In many data streaming applications today, tuples inside the streams may get revised over time. This type of data stream brings new issues and challenges to the data mining tasks. We present a theoretical analysis for mining frequent itemsets from sliding windows over such data. We define conditions that determine whether an infrequent itemset will become frequent when some existing tuples inside the streams have been updated. We design simple but effective structures for managing both the evolving tuples and the candidate frequent itemsets. Moreover, we provide a novel verification method that efficiently computes the counts of candidate itemsets. Experiments on real-world datasets show the efficiency and effectiveness of our proposed method.

Dates and versions

lirmm-00830923 , version 1 (06-06-2013)



Chongsheng Zhang, Yuan Hao, Mirjana Mazuran, Carlo Zaniolo, Hamid Mousavi, et al.. Mining frequent itemsets over tuple-evolving data streams. SAC: Symposium on Applied Computing, Mar 2013, Coimbra, Portugal. pp.267-274, ⟨10.1145/2480362.2480419⟩. ⟨lirmm-00830923⟩
412 View
0 Download



Gmail Mastodon Facebook X LinkedIn More