[1] BHATTACHARYA S, MOON S. Network performance monitoring and measurement:techniques and experience[M]//Universal Access in Human-Computer Interaction. Access to Interaction. Berlin:Springer, 2015:528-537. [2] 王爽,王国仁.面向不确定感知数据的频繁项查询算法[J].计算机学报,2013,36(3):571-581.(WANG S, WANG G R. Frequent items query algorithm for uncertain sensing data[J]. Chinese Journal of Computers, 2013, 36(3):571-581.) [3] 金澈清,钱卫宁,周傲英.流数据分析与管理综述[J].软件学报,2004,15(8):1172-1181.(JIN C Q, QIAN W N, ZHOU A Y. Analysis and management of streaming data[J]. Journal of Software, 2004, 15(8):1172-1181. [4] HENZINGER M R, RAGHAVAN P, RAJAGOPALAN S. Computing on data streams[C]//Proceedings of the 1999 External Memory Algorithms:DIMACS Workshop External Memory and Visualization. Boston:American Mathematical Society, 1999:107-118. [5] MANKU G, MOTWANI R. Approximate frequency counts over data streams[C]//Proceedings of the 28th International Conference on Very Large Data Bases.[S.l.]:VLDB Endowment, 2002:346-357. [6] YU J, CHONG Z, LU H, et al. False positive or false negative:mining frequent itemsets from high speed transactional data streams[C]//Proceedings of the Thirtieth International Conference on Very Large Data Bases.[S.l.]:VLDB Endowment, 2004:204-215. [7] MOZAFARI B, THANKKAR H, ZANIOLO C. Verifying and mining frequent patterns from large windows over data streams[C]//ICDE 2008:Proceedings of the IEEE 24th International Conference on Data Engineering. Piscataway, NJ:IEEE, 2008:179-188. [8] LEUNG C K S, KHAN Q. DSTree:a tree structure for the mining of frequent sets from data streams[C]//ICDM'06:Proceedings of the 2006 Sixth International Conference on Data Mining. Piscataway, NJ:IEEE, 2006:928-932. [9] HRISTIDIS V, VALDIVIA O, VLACHOS M, et al. Information discovery across multiple streams[J]. Information Sciences, 2009, 179(19):3268-3285. [10] YEH M Y, DAI B R, CHEN M S. Clustering over multiple evolving streams by events and correlations[J]. IEEE Transactions on Knowledge and Data Engineering, 2007, 19(10):1349-1362. [11] GUO J, ZHANG P, TAN J, et al. Mining frequent patterns across multiple data streams[C]//Proceedings of the 20th ACM International Conference on Information and Knowledge Management. New York:ACM, 2011:2325-2328. [12] 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. [13] CHANG J H, LEE W S. Finding recent frequent itemsets adaptively over online data streams[C]//Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2003:487-492. [14] AGRAWAL R, SRIKANT R. Privacy-preserving data mining[C]//Proceedings of the 2009 ACM SIGMOD Record. New York:ACM, 2000, 29(2):439-450. [15] BERNECKER T, CHENG R, CHEUNG D W, et al. Model-based probabilistic frequent itemset mining[J]. Knowledge and Information Systems, 2013, 37(1):181-217. |