Efficient Data Streams Based Closed Frequent Itemsets Mining Algorithm


Article Preview

Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we proposed a novel sliding window based algorithm. The algorithm exploits lattice properties to limit the search to frequent close itemsets which share at least one item with the new transaction. Experiments results on synthetic datasets show that our proposed algorithm is both time and space efficient.



Edited by:

Xiangdong Zhang, Hongnan Li, Xiating Feng and Zhihua Chen




J. Tan "Efficient Data Streams Based Closed Frequent Itemsets Mining Algorithm", Applied Mechanics and Materials, Vols. 256-259, pp. 2910-2913, 2013

Online since:

December 2012





[1] J. Pei, J. Han, and J. Wang, Closet+: Searching for the best strategies for mining frequent closed itemsets. ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, August (2003).

DOI: https://doi.org/10.1145/956755.956779

[2] Jiawei Han, Micheline Kamber, Data Mining Concepts and Techniques, mechanism industry publishing, Beijing, 2002, pp.156-160.

[3] Y. Chi, H. Wang, P.S. Yu, and R. R. Muntz. Moment: Maintaining closed frequent itemsets over a stream sliding window. In Proceedings of the 2004 IEEE International Conference on Data Mining (ICDM'04), November (2004).

DOI: https://doi.org/10.1109/icdm.2004.10084

[4] N. Jiang, L. Gruenwald. CFI-Stream: mining closed frequent itemsets in data streams. in KDD'06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining pages 592-597, (2006).

DOI: https://doi.org/10.1145/1150402.1150473

[5] Y. K. James Cheng and W. Ng. Maintaining frequent closed itemsets over a sliding window. Joural of Intelligent Information Systems, (2007).

DOI: https://doi.org/10.1007/s10844-007-0042-3

Fetching data from Crossref.
This may take some time to load.