Sliding window-based frequent pattern mining over data streams

Information Sciences

Volumn 179, Issue 22, 2009, Pages 3843-3865

  Tanbeer, Syed Khairuzzaman ^a   Ahmed, Chowdhury Farhan ^a   Jeong, Byeong Soo ^a   Lee, Young Koo ^a  

^a Kyung Hee University   (South Korea)

Author keywords

Data stream; Frequent pattern; Sliding window; Tree restructuring

Indexed keywords

DATA ELEMENTS; DATA STREAM; DYNAMIC TREES; EXPERIMENTAL ANALYSIS; FP-GROWTH MINING; FREQUENT PATTERN; FREQUENT PATTERN MINING; FREQUENT PATTERNS; HIGH-SPEED DATA; NETWORK MONITORING; NEW SOLUTIONS; RAPID RATE; RETAIL MARKET; RUNTIMES; SLIDING WINDOW; SLIDING WINDOW-BASED; STOCK MARKET PREDICTION; STREAM DATA; TIME COMPLEXITY; TREE RESTRUCTURING; TREE STRUCTURES; WEB USAGE MINING;

DATA COMMUNICATION SYSTEMS; DATA HANDLING; MINING; WINDOWS;

DATA MINING;

EID: 69549097483     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.07.012     Document Type: Article

References (44)

1. R. Agrawal, T. Imielinski, A.N. Swami, Mining association rules between sets of items in large databases, in: Proc. the ACM SIGMOD Conference on Management of Data, 1993, pp. 207-216.
2. Blake C.L., and Merz C.J. UCI Repository of Machine Learning Databases (1998), University of California-Irvine, Irvine, CA
3. Chang J.H., and Lee W.S. estWin: Online data stream mining of recent frequent itemsets by sliding window method. Journal of Information Science 31 2 (2005) 76-90
4. J.H. Chang, W.S. Lee, Finding recent frequent itemsets adaptively over online data streams, in: Proc. ACM SIGKDD Conference, 2003, pp. 487-492.
5. Chen G., and Wei Q. Fuzzy association rules and the extended mining algorithms. Information Sciences 147 1-4 (2002) 201-228
6. Chi Y., Wang H., Yu P.S., and Muntz R.R. Catch the moment: maintaining closed frequent itemsets over a data stream sliding window. Knowledge and Information Systems 10 3 (2006) 265-294
7. Gaber M.M., Zaslavsky A., and Krishnaswamy S. Mining data streams: a review. ACM SIGMOD Record 34 2 (2005) 18-26
8. Giannella C., Han J., Pei J., Yan X., and Yu P.S. Mining frequent patterns in data streams at multiple time granularities. Data Mining: Next Generation Challenges and Future Directions (2004), AAAI/MIT Press (Chapter 6)
9. R.P. Gopalan, Y.G. Sucahyo, High performance frequent patterns extraction using compressed FP-tree, in: Proc. The SIAM International Workshop on High Performance and Distributed Mining, April 2004.
10. J. Han, H. Cheng, D. Xin, X. Yan, Frequent pattern mining: current status and future directions, in: Data Mining and Knowledge Discovery, 10th Anniversary Issue, 2007, pp. 55-86.
11. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proc. the 2000 ACM SIGMOD International Conference on Management of Data, 2000, pp. 1-12.
12. Hsu P.-Y., Chen Y.-L., and Ling C.-C. Algorithms for mining association rules in bag databases. Information Sciences 166 (2004) 31-47
13. Hu T., Sung S.Y., Xiong H., and Fu Q. Discovery of maximum length frequent itemsets. Information Sciences 178 (2008) 69-87
14. IBM, QUEST Data Mining Project. .
15. Jiang N., and Gruenwald L. Research issues in data stream association rule mining. ACM SIGMOD Record 35 1 (2006) 14-19
16. J.-L. Koh, S.-F. Shieh, An efficient approach for maintaining association rules based on adjusting FP-tree structures, in: Y.-J. Lee, J. Li, K.-Y. Whang, D. Lee (Eds.), Proc. the DASFAA, 2004, pp. 417-424.
17. J.-L. Koh, S.-N. Shin, An approximate approach for mining recently frequent itemsets from data streams, in: A.M. Tjoa, J. Trujillo (Eds.), Proc. DaWaK, 2006, pp. 352-362.
18. R. Kohavi, C. Brodley, B. Frasca, L. Mason, Z. Zheng, KDD-Cup 2000 organizers' report: peeling the onion, SIGKDD Explorations 2(2) (2000) 86-98. .
19. Lee A.J.T., Hong R.W., Ko W.M., Tsao W.K., and Lin H.H. Mining spatial association rules in image databases. Information Sciences 177 7 (2007) 1593-1608
20. Lee A.J.T., and Wang C.-S. An efficient algorithm for mining frequent inter-transaction patterns. Information Sciences 177 (2007) 3453-3476
21. Lee Y.-S., and Yen S.-J. Incremental and interactive mining of web traversal patterns. Information Sciences 178 2 (2008) 287-306
22. C.K.-S. Leung, Q.I. Khan, DSTree: a tree structure for the mining of frequent sets from data streams, in: Proc. ICDM, 2006, pp. 928-932.
23. C.K.-S. Leung, Q.I. Khan, Efficient mining of constrained frequent patterns from streams, in: Proc. 10th International Database Engineering and Applications Symposium, 2006.
24. Li H.-F., and Lee S.-Y. Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Systems with Applications 36 (2009) 1466-1477
25. H.-F. Li, S.-Y. Lee, M.-K. Shan, An efficient algorithm for mining frequent itemsets over the entire history of data streams, in: Proc. International Workshop on Knowledge Discovery in Data Streams, 2004.
26. Li J., Maier D., Tuftel K., Papadimos V., and Tucker P.A. No pane, no gain: efficient evaluation of sliding-window aggregates over data streams. SIGMOD Record 34 1 (2005) 39-44
27. C.-H. Lin, D.-Y. Chiu, Y.-H. Wu, A.L.P. Chen, Mining frequent itemsets from data streams with a time-sensitive sliding window, in: Proc. SIAM International Conference on Data Mining, 2005.
28. G.S. Manku, R. Motwani, Approximate frequency counts over data streams, in: Proc. VLDB, 2002, pp. 346-357.
29. B. Mozafari, H. Thakkar, C. Zaniolo, Verifying and mining frequent patterns from large windows over data streams, in: Proc. ICDE, 2008 pp. 179-188.
30. Seno M., and Karypis G. Finding frequent patterns using length-decreasing support constraints. Data Mining and Knowledge Discovery 10 (2005) 197-228
31. Shen L., Shen H., and Cheng L. New algorithms for efficient mining of association rules. Information Sciences 118 (1999) 251-268
32. Silvestri C., and Orlando S. Approximate mining of frequent patterns on streams. Intelligent Data Analysis 11 (2007) 49-73
33. Tanbeer S.K., Ahmed C.F., Jeong B.-S., and Lee Y.-K. Efficient single-pass frequent pattern mining using a prefix-tree. Information Sciences 179 (2009) 559-583
34. S.K. Tanbeer, C.F. Ahmed, B.-S. Jeong, Y.-K. Lee, CP-tree: a tree structure for single-pass frequent pattern mining, in: T. Washio et al. (Eds.), Proc. PAKDD, 2008, pp. 1022-1027.
35. Tsay Y.J., and Chiang J.Y. An efficient cluster and decomposition algorithm for mining association rules. Information Sciences 160 1-4 (2004) 161-171
36. Tsay Y.-J., Hsu T.-J., and Yu J.-R. FIUT: a new method for mining frequent itemsets. Information Sciences 179 (2009) 1724-1737
37. Wang F.-H. On discovery of soft associations with "most" fuzzy quantifier for item promotion applications. Information Sciences 178 (2008) 1848-1876
38. Wang C.-Y., Tseng S.-S., and Hong T.-P. Flexible online association rule mining based on multidimensional pattern relations. Information Sciences 176 (2006) 1752-1780
39. F.-Y. Ye, J.-D. Wang, B.-L. Shao, New algorithm for mining frequent itemsets in sparse database, in: Proc. the Fourth International Conference on Machine Learning and Cybernetics, 2005, pp. 1554-1558.
40. 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 14 (2006) 1986-2015
41. J.X. Yu, Z. Chong, H. Lu, A. Zhou, False positive or false negative: mining frequent itemsets from high speed transactional data streams, in: Proc. VLDB, 2004, pp. 204-215.
42. Zaki M.J., and Hsiao C.-J. Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering 17 4 (2005) 462-478
43. Zhang S., Zhang J., and Zhang C. EDUA: an efficient algorithm for dynamic database mining. Information Sciences 177 (2007) 2756-2767
44. X. Zhi-Jun, C. Hong, C. Li, An efficient algorithm for frequent itemset mining on data streams, in: Proc. ICDM, 2006, pp. 474-491.