Mining recent frequent itemsets in data streams

Proceedings - 5th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008

Volumn 4, Issue , 2008, Pages 353-358

  Li, Kun ^a   Wang, Yong Yan ^a   Ellahi, Manzoor ^a,b   Wang, Hong An ^a  

^a INSTITUTE OF SOFTWARE   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAMS; FREQUENT ITEM SETS; INFREQUENT ITEMS; MINIMUM SUPPORT THRESHOLDS; MINIMUM SUPPORTS; MINING FREQUENT ITEMSETS; RESEARCH TOPICS; SLIDING WINDOWS; SPACE USAGES;

DATA MINING; DECODING; FUZZY LOGIC; FUZZY SYSTEMS; MINING; PROCESS ENGINEERING; WINDOWS;

TREES (MATHEMATICS);

EID: 58049205580     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FSKD.2008.255     Document Type: Conference Paper

References (11)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Int'l Conf. on Very Large Databases, pages 487-499. MorganKaufmann, 1994.
2. J. H. Chang and W. S. Lee. estwin: adaptively monitoring the recent change of frequent itemsets over online data streams. In CIKM '03: Proceedings of the twelfth international conference on Information and knowledge management, pages 536-539, New York, NY, USA, 2003. ACM.
3. J. Cheng, Y. Ke, and W. Ng. Maintaining frequent itemsets over high-speed data streams. In PAKDD'06: Advances in Knowledge Discovery and Data Mining, 10th Pacific-Asia Conference, pages 462-467, 2006.
4. Y. Chi, H. Wang, P. S. Yu, and R. R. Muntz. Moment: Maintaining closed frequent itemsets over a stream sliding window. In ICDM '04: Proceedings of the Fourth IEEE International Conference on Data Mining, pages 59-66, Washington, DC, USA, 2004. IEEE Computer Society.
5. C. Giannella, J. Han, J. Pei, X. Yan, and P. S. Yu. Mining frequent patterns in data streams at multiple time granularities. In In Proceedings of the NSF Workshop on Next Generation Data Mining, 2002.
6. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM SIGMOD Int'l Conf. on Management of Data, pages 1-12, New York, NY, USA, 2000. ACM.
7. M.-K. S. Hua-Fu Li, Chin-Chuan Ho and S.-Y. Lee. Efficient maintenance and mining of frequent itemsets over online data streams with a sliding window. In IEEE International Conference on Systems, Man and Cybernetics (SMC-2006), 2006.
8. N. Jiang and L. Gruenwald. Research issues in data stream association rule mining. SIGMOD Record, 35(1):14-19, 2006.
9. G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In VLDB '02: Proceedings of the 28th international conference on Very Large Data Bases, pages 346-357. VLDB Endowment, 2002.
10. M. J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3):372-390, 2000.
11. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In F. Provost and R. Srikant, editors, Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 401-406, 2001.