Sliding Window-based Frequent Itemsets Mining over Data Streams using Tail Pointer Table

References

• R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, in Proc. International Conference on Very Large Data Bases, (Santiago, Chile, 1994), pp.487-487.
   Google Scholar
• J. Han, J. Pei and Y. Yin, Mining frequent patterns without candidate generation, in Proc. ACM SIGMOD International Conference on Management of Data, (Dallas, TX, United states, 2000), pp.1-12.
   Google Scholar
• M. El-hajj and O.R. Zaïane, COFI-tree mining: a new approach to pattern growth with reduced candidacy generation, in Proc. IEEE International Conference on Frequent Itemset Mining Implementations, 2003)
   Google Scholar
• M. Song and S. Rajasekaran, A transaction mapping algorithm for frequent itemsets mining, IEEE Transactions on Knowledge and Data Engineering 4(18) (2006) 472-481.
   Google Scholar
• T. Hu, S.Y. Sung, H. Xiong and Q. Fu, Discovery of maximum length frequent itemsets, Information Sciences 178(1) (2008) 69-87.
   Web of Science ®Google Scholar
• B. Vo, T. Hong and B. Le, DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets, Expert Systems with Applications 39(8) (2012) 7196-7206.
   Web of Science ®Google Scholar
• C.W. Lin, T.P. Hong and W.H. Lu, An effective tree structure for mining high utility itemsets, Expert Systems with Applications 38(6) (2011) 7419-7424.
   Web of Science ®Google Scholar
• V.S. Tseng, C.W. Wu, B.E. Shie and P.S. Yu, UP-Growth: An efficient algorithm for high utility itemset mining, in Proc. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (Washington, DC, United states, 2010), pp.253-262.
   Google Scholar
• C.F. Ahmed, S.K. Tanbeer, B.S. Jeong and Y.K. Lee, Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases, IEEE Transactions on Knowledge and Data Engineering 21(12) (2009) 1708-1721.
   Web of Science ®Google Scholar
• Y.C. Li, J.S. Yeh and C.C. Chang, Isolated items discarding strategy for discovering high utility itemsets, Data and Knowledge Engineering 64(1) (2008) 198-217.
   Web of Science ®Google Scholar
• M. Liu and J. Qu, Mining high utility itemsets without candidate generation, in Proc. 21st ACM International Conference on Information and Knowledge Management, (Maui, HI, United states, 2012), pp.55-64.
   Google Scholar
• C.W. Lin and T.P. Hong, A new mining approach for uncertain databases using CUFP trees, Expert Systems with Applications 39(4) (2011) 4084-4093.
   Web of Science ®Google Scholar
• C.K. Leung and F. Jiang, Frequent pattern mining from time-fading streams of uncertain data, in Proc. 13th International Conference on Data Warehousing and Knowledge Discovery, (Toulouse, France, 2011), pp.252-264.
   Google Scholar
• C.K. Leung, M.A.F. Mateo and D.A. Brajczuk, A tree-based approach for frequent pattern mining from uncertain data, in Proc. 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining, (Osaka, Japan, 2008), pp.653-661.
   Google Scholar
• Z. Farzanyar, M. Kangavari and N. Cercone, Max-FISM: Mining (recently) maximal frequent itemsets over data streams using the sliding window model, Computers & Mathematics with Applications 64(6) (2012) 1706-1718.
   Web of Science ®Google Scholar
• Y. Chi, H. Wang, S.Y. Philip 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.
   Web of Science ®Google Scholar
• F. Nori, M. Deypir and M.H. Sadreddini, A sliding window based algorithm for frequent closed itemset mining over data streams, Journal of Systems and Software (2012)
   PubMed Web of Science ®Google Scholar
• C.K.S. Leung and Q.I. Khan, DSTree: A tree structure for the mining of frequent sets from data streams, in Proc. IEEE International Conference on Data Mining, (Hong Kong, China, 2007), pp.928-932.
   Google Scholar
• C. Leung and D. Brajczuk, Efficient Mining of Frequent Itemsets from Data Streams, Sharing Data, Information and Knowledge (2008) 2-14.
   Google Scholar
• S.K. Tanbeer, C.F. Ahmed, B. Jeong and Y. Lee, Sliding window-based frequent pattern mining over data streams, Information Sciences 179(22) (2009) 3843-3865.
   Web of Science ®Google Scholar
• M. Deypir and M.H. Sadreddini, A dynamic layout of sliding window for frequent itemset mining over data streams, Journal of Systems and Software 85(3) (2012) 746-759.
   Web of Science ®Google Scholar
• B. Goethals, Frequent itemset mining dataset repository, http://fimi.cs.helsinki.fi/data/, accessed Oct. 2010.
   Google Scholar