An adaptive approximation method to discover frequent itemsets over sliding-window-based data streams

Expert Systems with Applications

Volumn 38, Issue 10, 2011, Pages 13386-13404

  Li, Chao Wei ^a   Jea, Kuen Fang ^a  

^a NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

Author keywords

Adaptive approximation; Combinatorial Approximation; Concept drift; Data stream; Frequent itemset; Sliding window

Indexed keywords

ADAPTIVE APPROXIMATION; COMBINATORIAL APPROXIMATION; CONCEPT DRIFT; DATA STREAM; FREQUENT ITEMSET; SLIDING WINDOW;

APPROXIMATION THEORY; DATA COMMUNICATION SYSTEMS;

DATA MINING;

EID: 79957995370     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2011.04.167     Document Type: Article

References (9)

1. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th conference on very large data bases (pp. 487-499).
2. Bodon, F. (2003). A fast APRIORI implementation. In Proceedings of the ICDM workshop on frequent itemset mining implementations (FIMI'03).
3. J.H. Chang, and W.S. Lee A sliding window method for finding recently frequent itemsets over online data streams Journal of Information Science and Engineering 20 4 2004 753 762
4. J. Cheng, Y. Ke, and W. Ng Maintaining frequent closed itemsets over a sliding window Intelligent Information Systems 31 3 2008 191 215
5. K.-F. Jea, and C.-W. Li Discovering frequent itemsets over transactional data streams through an efficient and stable approximate approach Expert Systems with Applications 36 10 2009 12323 12331
6. N. Linial, and N. Nisan Approximate inclusion-exclusion Combinatorica 10 4 1990 349 365
7. C.L. Liu Introduction to combinatorial mathematics 1968 McGraw-Hill New York
8. Quest Data Mining Synthetic Data Generation Code [WWW page]. URL .
9. Zhu, Y., & Shasha, D. (2002). StatStream: Statistical monitoring of thousands of data streams in real time. In Proceedings of the 28th conference on very large data bases (pp. 358-369).