Mining frequent itemsets in time-varying data streams

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2009, Pages 1521-1524

  Tao, Yingying ^a   Özsu, M Tamer ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Data stream; Frequent itemset

Indexed keywords

ACCURACY RATE; ARRIVAL RATES; DATA STREAM; FREQUENT ITEMSET; FREQUENT ITEMSETS; MINING FREQUENT ITEMSETS; REAL-WORLD APPLICATION; TIME-VARYING DATA;

DATA COMMUNICATION SYSTEMS; HYDRAULICS; KNOWLEDGE MANAGEMENT; TIME VARYING SYSTEMS;

DATA MINING;

EID: 74549172516     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1646161     Document Type: Conference Paper

References (7)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. on Very Large Data Bases, pages 487-499, 1994.
2. J. Chang and W. Lee. A sliding window method for finding recently frequent itemsets over online data streams. Journal of Information Science and Engineering, pages 753-762, 2004.
3. Y. Chi, H. Wang, P. Yu, and R. Muntz. Moment: Maintaining closed frequent itemsets over a stream sliding window. In Proc. 2004 IEEE Int. Conf. on Data Mining, pages 59-66, 2004.
4. M. Gaber, A. Zaslavsky, and S. Krishnaswamy. Mining data streams: A review. ACM SIGMOD Record, (2):18-26, 2005.
5. N. Jiang and L. Gruenwald. Research issues in data stream association rule mining. ACM SIGMOD Record, (1):14-19, 2006.
6. Manku and Motwani. Approximate frequency counts over data streams. In Proc. 28th Int. Conf. on Very Large Data Bases, pages 346-357, 2002.
7. J. Yu, Z. Chong, H. Lu, and A. Zhou. False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In Proc. 30th Int. Conf. on Very Large Data Bases, pages 204-215, 2004.