scholarly journals Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window

Author(s):  
Chih-Hsiang Lin ◽  
Ding-Ying Chiu ◽  
Yi-Hung Wu ◽  
Arbee L. P. Chen
2012 ◽  
Vol 256-259 ◽  
pp. 2910-2913
Author(s):  
Jun Tan

Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we proposed a novel sliding window based algorithm. The algorithm exploits lattice properties to limit the search to frequent close itemsets which share at least one item with the new transaction. Experiments results on synthetic datasets show that our proposed algorithm is both time and space efficient.


2018 ◽  
Vol 11 (8) ◽  
pp. 85-94
Author(s):  
Jeong Hee Hwang ◽  
Hyeok Kim ◽  
Jeong Hee Chi

Sign in / Sign up

Export Citation Format

Share Document