Discovering frequent itemsets over transactional data streams through an efficient and stable approximate approach

Expert Systems with Applications

Volumn 36, Issue 10, 2009, Pages 12323-12331

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

^a NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

Author keywords

Approximation; Combinatorics; Data mining; Data stream; Frequent itemset

Indexed keywords

APPROXIMATE INCLUSION; APPROXIMATION; BOUNDING TECHNIQUES; COMBINATORICS; DATA ELEMENTS; DATA STREAM; FREQUENT ITEMSET; FREQUENT ITEMSETS; ITEM SETS; MINING ALGORITHMS; PERFORMANCE IMPROVEMENTS; TRANSACTIONAL DATA STREAMS;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; MINING;

DATA MINING;

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

References (13)

1. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th international conference on VLDB (pp. 487-499).
2. Bodon, F. (2003). A fast APRIORI implementation. In Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations (FIMI'03).
3. Chang, J. H., & Lee, W. S. (2003). Finding recent frequent itemsets adaptively over online data streams. In Proceedings of the 9th ACM SIGKDD conference on KDDM (pp. 487-492).
4. Chernoff H. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics 23 4 (1952) 493-507
5. Garofalakis, M., Gehrke, J., & Rastogi, R. (2002). Querying and mining data streams: you only get one look. In Proceedings of the 28th international conference on VLDB (p. 635).
6. Jea K.-F., Chang M.-Y., and Lin K.-C. An efficient and flexible algorithm for online mining of large itemsets. Information Processing Letters 92 (2004) 311-316
7. Li H.-F., Ho C.-C., and Lee S.-Y. Incremental updates of closed frequent itemsets over continuous data streams. Expert Systems with Applications 36 (2009) 2451-2458
8. Linial N., and Nisan N. Approximate inclusion-exclusion. Combinatorica 10 (1990) 349-365
9. Liu C.L. Introduction to combinatorial mathematics (1968), McGraw-Hill, New York
10. Manku, G. S., & Motwani, R. (2002). Approximate frequency counts over data streams. In Proceedings of the 28th international conference on VLDB (pp. 346-357).
11. Shin, S. J., & Lee, W. S. (2007). An on-line interactive method for finding association rules data streams. In Proceedings of the 16th ACM conference on CIKM (pp. 963-966).
12. Woo, H. J., & Lee, W. S. (2007). estMax: Tracing maximal frequent itemsets over online data streams. In Proceedings of the 7th IEEE international conference on data mining (pp. 709-714).
13. Yu J.X., Chong Z., Lu H., Zhang Z., and Zhou A. A false negative approach to mining frequent itemsets from high speed transactional data streams. Information Sciences 176 (2006) 1986-2015