A dynamic layout of sliding window for frequent itemset mining over data streams

Journal of Systems and Software

Volumn 85, Issue 3, 2012, Pages 746-759

  Deypir, Mahmood ^a   Sadreddini, Mohammad Hadi ^a  

^a SHIRAZ UNIVERSITY   (Iran)

Author keywords

Data stream; Data stream mining; Frequent patterns; Sliding window; Window adjustment

Indexed keywords

DATA STREAM; DATA STREAM MINING; DYNAMIC LAYOUT; EMPIRICAL RESULTS; FREQUENT ITEMSET MINING; FREQUENT PATTERNS; MAIN MEMORY; MEMORY EFFICIENT; MEMORY USAGE; MINING PROCESS; MULTIPLE ORDERS; NEW APPLICATIONS; PROCESSING POWER; RUNTIME AND MEMORY USAGE; SLIDING WINDOW; SLIDING WINDOW-BASED;

ALGORITHMS; DATA COMMUNICATION SYSTEMS;

DATA MINING;

EID: 84857355203     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jss.2011.09.055     Document Type: Article

References (34)

1. R. Agrawal, and R. Srikant Fast algorithms for mining association rules Proc. VLDB Int. Conf. Very Large Databases 1994 487 499
2. R. Agrawal, T. Imielinski, and A.N. Swami Mining association rules between sets of items in large databases Proc. ACM SIGMOD Conf. Management of Data 1993 207 216
3. F. Bodon A fast apriori implementation Proc. IEEE ICDM Workshop on Frequent Itemset Mining Implementations 2003
4. C. Borgelt Efficient implementations of apriori and Eclat Proc. IEEE ICDM Workshop on Frequent Itemset Mining Implementations November 19, 2003 2003
5. T. Calders, and B. Goethals Non-derivable itemset mining Data Mining and Knowledge Discovery 14 1 2007 71 206
6. J.H. Chang, and W.S. Lee estWin: online data stream mining of recent frequent itemsets by sliding window method Journal of Information Science 31 2 2005 76 90 (Pubitemid 43066256)
7. Y.K.J. Cheng, and W. Ng Maintaining frequent closed itemsets over a sliding window Journal of Intelligent Information Systems 31 3 2007 191 215
8. Y. Chi, H. Wang, P.S. Yu, and R.R. Muntz Catch the moment: maintaining closed frequent itemsets over a data stream sliding window Knowledge and Information Systems 10 3 2006 265 294 (Pubitemid 44489997)
9. G. Cormode, and M. Hadjieleftheriou Methods for finding frequent items in data streams The VLDB Journal - The International Journal on Very Large Data Bases 19 1 2010 3 20
10. C. Giannella, J. Han, J. Pei, X. Yan, and P.S. Yu Mining frequent patterns in data streams at multiple time granularities Data Mining: Next Generation Challenges and Future Directions 2004 AAAI/MIT Press (Chapter 6)
11. R.P. Gopalan, and Y.G. Sucahyo High performance frequent patterns extraction using compressed FP-tree Proc. the SIAM International Workshop on High Performance and Distributed Mining 2004
12. 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 2004 53 87 (Pubitemid 39019971)
13. J. Han, H. Cheng, D. Xin, and X. Yan Frequent pattern mining: current status and future directions Data Mining and Knowledge Discovery 15 1 2007 55 86 (Pubitemid 47142811)
14. J.-L. Koh, and C.-Y. Lin Concept shift detection for frequent itemsets from sliding window over data streams Lecture Notes in Computer Science: Database Systems for Advanced Applications, DASFAA 2009 Int. Workshops 2009 Springer-Verlag 334 348
15. C.K.-S. Leung, and Q.I. Khan DSTree: a tree structure for the mining of frequent sets from data streams Proc. ICDM 2006 928 932
16. H. Li, and H. Chen Mining non-derivable frequent itemsets over data stream Data & Knowledge Engineering 68 5 2009 481 498
17. H.-F. Li, and S.-Y. Lee Mining frequent itemsets over data streams using efficient window sliding techniques Expert Systems with Applications 36 2 2009 1466 1477
18. H.-F. Li, S.-Y. Lee, and M.-K. Shan An efficient algorithm for mining frequent itemsets over the entire history of data streams Proc. Int. Workshop on Knowledge Discovery in Data Streams 2004
19. C.-H. Lin, D.-Y. Chiu, Y.-H. Wu, and A.L.P. Chen Mining frequent itemsets from data streams with a time-sensitive sliding window Proc. SIAM Int. Conf. Data Mining 2005
20. G.S. Manku, and R. Motwani Approximate frequency counts over data streams Proc. VLDB Int. Conf. Very Large Databases 2002 346 357
21. B. Mozafari, H. Thakkar, and C. Zaniolo Verifying and mining frequent patterns from large windows over data streams Proc. Int. Conf. ICDE, 2008 2008 179 188
22. C. Raïssi, P. Poncelet, and M. Teisseire Towards a new approach for mining frequent itemsets on data stream Journal of Intelligent Information Systems 28 1 2007 23 36
23. A. Savasere, E. Omiecinski, and S. Navathe An efficient algorithm for mining association in large databases Proceeding of the VLDB International Conference on Very Large Databases 1995 432 444
24. C. Silvestri, and S. Orlando Approximate mining of frequent patterns on streams Intelligent Data Analysis 11 1 2007 49 73
25. S.K. Tanbeer, C.F. Ahmed, B.-S. Jeong, and Y.-K. Lee Sliding window-based frequent pattern mining over data streams Information Sciences 179 22 2009 3843 3865
26. H. Toivonen Sampling large databases for association rules Proc. 22nd Int. Conf. VLDB 1996 134 145
27. P.S.M. Tsai Mining frequent itemsets in data streams using the weighted sliding window model Expert Systems with Applications 36 9 2009 11617 11625
28. H.J. Woo, and W.S. Lee estMax: tracing maximal frequent item sets instantly over online transactional data streams IEEE Transactions on Knowledge and Data Engineering 21 10 2009 1418 1431
29. F.-Y. Ye, J.-D. Wang, and B.-L. Shao New algorithm for mining frequent itemsets in sparse database Proc. the Fourth International Conference on Machine Learning and Cybernetics 2005 1554 1558 (Pubitemid 41734173)
30. J.X. Yu, Z. Chong, H. Lu, Z. Zhang, and A. Zhou A false negative approach to mining frequent itemsets from high speed transactional data streams Information Sciences 176 14 2006 1986 2015
31. M. Zaki Scalable algorithms for association mining IEEE Transactions on Knowledge and Data Engineering 12 3 2000 372 390
32. M. Zaki, and K. Gouda Fast vertical mining using Diffsets Proc. 8th Int. Conf. ACM SIGKDD Knowledge Discovery and Data Mining 2003 326 335
33. M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li New algorithms for fast discovery of association rules Proc. 3rd Int. Conf. Knowledge Discovery and Data Mining, KDD'09 1997 283 286
34. X. Zhi-Jun, C. Hong, and C. Li An efficient algorithm for frequent itemset mining on data streams Proc. ICDM 2006 474 491 (Pubitemid 44124078)