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

Proceedings of the 2005 SIAM International Conference on Data Mining, SDM 2005

Volumn , Issue , 2005, Pages 68-79

  Lin, Chih Hsiang ^a   Chiu, Ding Ying ^a   Wu, Yi Hung ^a   Chen, Arbee L P ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b NATIONAL CHENGCHI UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; SENSOR NETWORKS; SPACE DIVISION MULTIPLE ACCESS;

DYNAMIC ENVIRONMENTS; FALSE DISMISSALS; MINING FREQUENT ITEMSETS; MINING TECHNIQUES; NEW APPLICATIONS; PARAMETER SETTING; STORAGE STRUCTURES; TIME-SENSITIVE SLIDING WINDOWS;

DATA MINING;

EID: 78650364804     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972757.7     Document Type: Conference Paper

References (28)

1. D.J. Abadi, D. Carney, U. Cetintemel, et al., "Aurora: A New Model and Architecture for Data Stream Management," The VLDB Journal, 12(2): 120-139, 2003.
2. R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. of VLDB Conf., pp. 487-499, 1994.
3. A. Arasu and G.S. Manku, "Approximate Counts and Quantiles over Sliding Windows," Proc. of ACM PODS Symp., 2004.
4. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom, "Models and Issues in Data Stream Systems," Proc. of ACM PODS Symp., 2002.
5. B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan, "Maintaining Variance and k-Medians over Data Stream Windows," Proc. of ACM PODS Symp., 2003.
6. S. Chandrasekaran, O. Cooper, A. Deshpande, M.J. Franklin, et al., "TelegraphCQ: Continuous Dataflow Processing for an Uncertain World," The First Conf. on Innovative Data Systems Research (CIDR), 2003.
7. J.H. Chang and W.S. Lee, "Finding Recent Frequent Itemsets Adaptively over Online Data Streams," Proc. of ACM SIGKDD Conf., pp. 487-492, 2003.
8. C.H. Chang and S.H. Yang, "Enhancing SWF for Incremental Association Mining by Itemset Maintenance," Proc. of Pacific-Asia Conf. on Knowledge Discovery and Data Mining, 2003.
9. M. Charikar, K. Chen, and M. Farach-Colton, "Finding Frequent Items in Data Streams," Proc. of Inter'l Colloquium on Automata, Languages and Programming (ICALP), pp. 693-703, 2002.
10. M. Charikar, L. O'Callaghan, and R. Panigrahy, "Better Streaming Algorithms for Clustering Problems," Proc. of ACM Symp. on Theory of Computing (STOC), pp. 30-39, 2003.
11. J. Chen, D.J. DeWitt, F. Tian, and Y. Wang, "NiagaraCQ: A Scalable Continuous Query System for Internet Databases," Proc. of ACM SIGMOD Conf., pp. 379-390, 2000.
12. D. Cheung, J. Han, V. Ng, and C.Y. Wong, "Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique," Proc. of ICDE Conf., 1996.
13. E. Cohen and M. Strauss, "Maintaining Time Decaying Stream Aggregates," Proc. of ACM PODS Symp., 2003.
14. G. Cormode and S. Muthukrishnan, "What's Hot and What's Not: Tracking Most Frequent Items Dynamically," Proc. of ACM PODS Symp., pp. 296-306, 2003.
15. E. Demaine, A. Lopez-Ortiz, and J.I. Munro, "Frequency Estimation of Internet Packet Streams with Limited Space," Proc. of European Symp. on Algorithms (ESA), pp. 348-360, 2002.
16. C. Giannella, J. Han, J. Pei, X. Yan, and P.S. Yu, "Mining Frequent Patterns in Data Streams at Multiple Time Granularities," H. Kargupta, A. Joshi, K. Sivakumar, and Y. Yesha (eds.), Next Generation Data Mining, pp. 191-212, 2003.
17. L. Golab and M. Ozsu, "Issues in Data Stream Management," ACM SIGMOD Record, 32(2): 5-14, 2003.
18. J. Han, J. Pei, Y. Yin, and R. Mao, "Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach," Data Mining and Knowledge Discovery, 8(1): 53-87, Kluwer Academic Publishers, 2004.
19. G. Hulten, L. Spencer, and P. Domingos, "Mining Time Changing Data Streams," Proc. of ACM CIKM Conf., pp. 97-106, 2001.
20. C. Jin, W. Qian, C. Sha, J.X. Yu, and A. Zhou, "Dynamically Maintaining Frequent Items over a Data Stream," Proc. of ACM CIKM Conf., 2003.
21. R.M. Karp, C.H. Papadimitriou, and S. Shenker, "A Simple Algorithm for Finding Frequent Elements in Streams and Bags," ACM Trans. on Database Systems (TODS), 28(1): 51-55, 2003.
22. C. Lee, C. Lin, and M. Chen, "Sliding-window Filtering: An Efficient Algorithm for Incremental Mining," Proc. of ACM CIKM Conf., 2001.
23. J. Liu, Y. Pan, K. Wang, and J. Han, "Mining Frequent Item Sets by Opportunistic Projection," Proc. of ACM SIGKDD Conf., 2002.
24. G. Manku and R. Motwani, "Approximate Frequency Counts over Data Streams," Proc. of VLDB Conf., pp. 346-357, 2002.
25. R. Motwani, J. Widom, A. Arasu, and B. Babcock, "Query Processing, Approximation, and Resource Management in a Data Stream Management System," CIDR Conf., 2003.
26. L. O'Callaghan, N. Mishra, A. Meyerson, S. Guha, and R. Motwani, "Streaming-Data Algorithms for High-Quality Clustering," Proc. of ICDE, pp. 685-696, 2002.
27. W. Teng, M.S. Chen and P. Yu, "A Regression-Based Temporal Pattern Mining Scheme for Data Streams," Proc. of VLDB Conf., pp.93-104, 2003.
28. Y. Zhu and D. Shasha, "StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time," Proc. of VLDB Conf., 2002.