[1] AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large databases[J].ACM SIGMOD Record, 1993, 22(2):207-216. [2] HAN J, PEI J, YIN Y, et al. Mining frequent patterns without candidate generation:a frequent-pattern tree approach[J]. Data Mining and Knowledge Discovery, 2004, 8(1):53-87. [3] TSENG V S, SHIE B E, WU C W, et al. Efficient algorithms for mining high utility itemsets from transactional databases[J]. IEEE Transactions on Knowledge and Data Engineering, 2013, 25(8):1772-1786. [4] GRAHNE G, ZHU J. Fast algorithms for frequent itemset mining using FP-trees[J]. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(10):1347-1362. [5] ZENG X, PEI J, WANG K, et al. PADS:a simple yet effective pattern-aware dynamic search method for fast maximal frequent pattern mining[J]. Knowledge and Information Systems, 2009, 20(3):375-391. [6] MUZAMMAL M, RAMAN R. Mining sequential patterns from probabilistic databases[C]//Proceedings of the 2011 Pacific-Asia Conference on Knowledge Discovery and Data Mining. Berlin:Springer, 2011:210-221. [7] AGGARWAL C, HAN J. Frequent Pattern Mining[M]. Berlin:Springer, 2014:19-61. [8] ZHANG X, ZHANG Y. Sliding-window top-k pattern mining on uncertain streams[J]. Journal of Computational Information Systems, 2011, 7(3):984-992. [9] 杨皓, 段磊, 胡斌, 等. 带间隔约束的Top-k 对比序列模式挖掘[J]. 软件学报, 2015, 26(11):2994-3009.(YANG H, DUAN L, HU B, et al. Mining Top-k distinguishing sequential patterns with gap constraint[J]. Journal of Software, 2015, 26(11):2994-3009.) [10] CHEN H. Mining top-k frequent patterns over data streams sliding window[J]. Journal of Intelligent Information Systems, 2014, 42(1):111-131. [11] ZIHAYAT M, AN A. Mining top-k high utility patterns over data streams[J]. Information Sciences, 2014, 285(1):138-161. [12] YUN U, LEE G. Sliding window based weighted erasable stream pattern mining for stream data applications[J]. Future Generation Computer Systems, 2016, 59(C):1-20. [13] LI T. Fuzziness in systems modelling[J]. International Journal of General Systems, 2013, 42(1):1-2. [14] CHEN H, LI T, LUO C, et al. A decision-theoretic rough set approach for dynamic data mining[J]. IEEE Transactions on Fuzzy Systems, 2015, 23(6):1958-1970. [15] 牛新征, 余堃. 基于FPMAX的最大频繁项目集挖掘改进算法[J]. 计算机科学, 2013, 40(12): 223-228.(NIU X Z, SHE K. Mining maximal frequent item sets with improved algorithm of FPMAX [J]. Computer Science, 2013, 40(12): 223-228.) |