Mining Frequent Itemsets over Recent Data Stream Based on Genetic Algorithm
暂无分享,去创建一个
[1] P. J. Narayanan,et al. Accelerating Large Graph Algorithms on the GPU Using CUDA , 2007, HiPC.
[2] Tzung-Pei Hong,et al. Maintenance of fast updated frequent pattern trees for record deletion , 2009, Comput. Stat. Data Anal..
[3] Won Suk Lee,et al. Finding recent frequent itemsets adaptively over online data streams , 2003, KDD '03.
[4] Carson Kai-Sang Leung,et al. DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams , 2006, Sixth International Conference on Data Mining (ICDM'06).
[5] Won Suk Lee,et al. A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams , 2004, J. Inf. Sci. Eng..
[6] Kuen-Fang Jea,et al. An adaptive approximation method to discover frequent itemsets over sliding-window-based data streams , 2011, Expert Syst. Appl..
[7] Young-Koo Lee,et al. Sliding window-based frequent pattern mining over data streams , 2009, Inf. Sci..
[8] PeiJian,et al. Mining Frequent Patterns without Candidate Generation , 2000 .
[9] Zhong Cheng. An Algorithm for Mining Maximal Frequent Patterns Based on FP-tree , 2004 .
[10] Róbert Mészáros,et al. Air pollution modelling using a Graphics Processing Unit with CUDA , 2010, Comput. Phys. Commun..
[11] Hongye Su,et al. Approximate mining of global closed frequent itemsets over data streams , 2011, J. Frankl. Inst..