CP-tree: An adaptive synopsis structure for compressing frequent itemsets over online data streams

Information Sciences

Volumn 278, Issue , 2014, Pages 559-576

  Shin, Se Jung ^a   Lee, Dae Su ^a   Lee, Won Suk ^a  

^a Yonsei University   (South Korea)

Author keywords

Data mining; Data stream; Frequent itemset; Frequent itemset compression; Stream data mining

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATA MINING;

DATA MINING PROCESS; DATA STREAM; FALSE POSITIVE; FREQUENT ITEMSET; MEMORY SPACE; MEMORY USAGE; PREFIX TREES; STREAM DATA MINING;

FORESTRY;

COMMUNICATION; DATA; FORESTRY; SYSTEMS;

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

References (33)

1. R.C. Agarwal, C.C. Aggarwal, V.V.V. Prasad, Depth first generation of long patterns, in: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2000, pp. 108-118.
2. R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: Proceedings of the 20th International Conference on Very Large Data, Bases, 1994, pp. 487-499.
3. R.J. Bayardo, Efficiently mining long patterns from databases, in: Proceedings of ACM Special Interest Group on Management of Data, 1998, pp. 85-93.
4. S. Brin, R. Motwani, J.D. Ullman, S. Tsur, Dynamic itemset counting and implication rules for market basket data, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1997, pp. 255-264.
5. D. Burdick, M. Calimlim, J. Gehrke, MAFIA: a maximal frequent itemset algorithm for transactional databases, in: Proceedings of the 17th International Conference on Data, Engineering, 2001, pp. 443-452.
6. J.H. Chang, W.S. Lee, Finding recent frequent itemsets adaptively over online data streams, in: Proceedings of the 9th ACM SIGKDD International conference on Knowledge Discovery and Data Mining, 2003, pp. 487-492.
7. M. Charikar, K. Chen, M. Farach-Colton, Finding frequent items in data streams, in: Proceedings of the 29th International Colloquium on Automata, Language and Programming, 2002, pp. 693-703.
8. Y. Chi, H. Wang, P. Yu, R. Muntz, Moment: Maintaining closed frequent itemsets over a stream sliding window, in: Proceedings of the 4th IEEE International Conference on Data Mining, 2004, pp. 59-66.
9. Z. Chong, J.X. Yu, H. Lu, Z. Zhang, A. Zhou, False-negative frequent items mining from data streams with bursting, in: Proceedings of the 10th International Conference on Database Systems for Advanced Applications, 2005, pp. 422-434.
10. M. Datar, A. Gionis, P. Indyk, R. Motwani, Maintaining stream statistics over sliding windows, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 635-644.
11. E.D. Demaine, A. Lopez-Ortiz, J.I. Munro, Frequency estimation of internet packet streams with limited space, in: Proc. 10th Annual European Symposium on Algorithms, 2002.
12. G. Dong, J. Han, L.V.S. Lakshmanan, J. Pei, H. Wang, P.S. Yu, Online mining of changes from data streams: research problems and preliminary results, in: Proceedings of the Workshop on Management and Processing of Data Streams, 2003.
13. M. Garofalakis, J. Gehrke, R. Rastogi, Querying and mining data streams: you only get one look, in: Tutorial Notes of the 28th International Conference on Very Large Data, Bases, 2002.
14. K. Gouda, and M. Zaki GenMax: an efficient algorithm for mining maximal frequent itemsets Data Min. Knowl. Disc. 11 2005 1 20
15. S. Guha, N. Koudas, Approximating a data stream for querying and estimation: algorithms and performance evaluation, in: Proceedings of the 18th International Conference on Data, Engineering, 2002, pp. 567-576.
16. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 2000, pp. 1-12.
17. C. Hidber, Online association rule mining, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1999, pp. 145-156.
18. H. Javitz, A. Valdes, The NIDES Statistical Component Description and Justification, Annual Report, SRI International, 1994.
19. N. Jiang, L. Gruenwald, CFI-stream: mining closed frequent itemsets in data streams, in: Proceedings of 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006.
20. D. Lin, and Z.M. Kedem Pincer-search: an efficient algorithm for discovering the maximum frequent set IEEE Trans. Knowl. Data Eng. 2002
21. G.S. Manku, R. Motwani, Approximate frequency counts over data streams, in: Proceedings of the 28th International Conference on Very Large Data, Bases, 2002, pp. 346-357.
22. A. Savasers, E. Omiecinski, S. Navathe, An efficient algorithm for mining association rules in large databases, in: Proceedings of the 21st International Conference on Very Large Data, Bases, 1995, pp. 432-444.
23. W-G. Teng, M-S. Chen, P.S. Yu, A regression-based temporal pattern mining scheme for data streams, in: Proceeding of the 29th International Conference on Very Large Database, Berlin, Germany, 2003.
24. J. Wang, J. Han, J. Pei, Closet+: searching for the best strategies for mining frequent closed itemsets, in: Proceedings of 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003.
25. D. Xin, J. Han, X. Yan, H. Cheng, Mining compressed frequent-pattern sets, in: Proceedings of the 31st International Conference on Very Large Data, Bases, 2005.
26. M. Zaki, C. Hsiao, Charm: an efficient algorithm for closed itemset mining, in: Proceedings of SIAM Conference on Data Mining, 2002.
27. J. Cheng, Y. Ke, and W. Ng A survey on algorithms for mining frequent itemsets over data streams Appeared Knowledge Inf. Syst. 16 1 2008 1 27
28. Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan, Online mining (recently) maximal frequent itemsets over data streams, in: Research Issues in Data Engineering: Stream Data Mining and Applications, RIDE-SDMA 2005, 2005, pp. 11-18.
29. K. Li, Y. Yan Wang, M. Ellahi, H. An Wang, Mining recent frequent itemsets in data streams, in: The 5th International Conference on Fuzzy Systems and Knowledge, Discovery, 2008.
30. X. Liu, J. Guan, and P. Hu Mining frequent closed itemsets from a landmark window over online data streams Comput. Math. Appl. 57 6 2009 927 936
31. J. Gama Knowledge Discovery from Data Streams 2010 Chapman & Hall/CRC Boca Raton, Florida
32. M. Sayed-Mouchaweh, and E. Lughofer Learning in Non-Stationary Environments: Methods and Applications 2012 Springer New York
33. E. Lughofer Evolving Fuzzy Systems: Methodologies, Advanced Concepts and Applications 2011 Springer Berlin Heidelberg