[1] HAN J, KAMBER M. Data mining: concepts and techniques[M]. Beijing: China Machine Press,2007: 25-26.(韩家炜, KAMBER M.数据挖掘:概念与技术[M].北京:机械工业出版社,2007: 25-26.) [2] CHUI C, KAO B. A decremental approach for mining frequent itemsets from uncertain data[C]//PAKDD 2008: Proceeding of the 12th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, LNCS 5012. Berlin: Springer-Verlag, 2008: 64-75. [3] CHUI C, KAO B, HUNG E. Mining frequent itemsets from uncertain data[C]//PAKDD 2007: Proceedings of the 11th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, LNCS 4426. Berlin: Springer-Verlag, 2007: 47-58. [4] BERNECKER T, KRIEGEL H P, RENZ M, et al. Probabilistic frequent itemset mining in uncertain databases[C]//KDD 2009: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM Press, 2009: 119-127. [5] BERNECKER T, KRIEGEL H P, RENZ M, et al. Probabilistic frequent pattern growth for itemset mining in uncertain databases[C]//Proceedings of the 24th International Conference on Scientific and Statistical Database Management, LNCS 7338. Berlin: Springer-Verlag,2012: 38-55. [6] CALDERS T, GARBONI C, GOETHALS B. Approximation of frequentness probability of itemsets in uncertain data[C]//Proceedings of the 2010 IEEE 10th International Conference on Data Mining. Piscataway: IEEE Press, 2010: 749-754. [7] WANG L, CHENG R, LEE S D, et al. Accelerrating probabilistic frequent itemset mining: a model-based approach[C]//CIKM 2010: Proceedings of the 19th ACM International Conference on Information and Knowledge Management. New York: ACM Press, 2010: 429-438. [8] CHI Y, WANG H, YU P, et al. Catch the moment: maintaining closed frequent itemsets over a data stream[J]. Knowledge and Information System,2006, 10(3): 265-294. [9] TONG Y, CHEN L, DING B. Discovering threshold-based fre-quent closed itemsets over probabilistic data[C]//Proceedings of the 28th IEEE International Conference on Data Engineering. Piscataway: IEEE Press, 2012: 270-281. [10] ANH T, TIN T, BAC L. Simultaneous mining of frequent closed itemsets and their generators: foundation and algorithm[J]. Engineering Application of Artificial Intelligence,2014, 36:64-80. [11] TANG P, PETERSON E A. Mining probabilistic frequent closed itemsets in uncertain databases[C]//ACM-SE 2011: Proceedings of the 49th Annual Southeast Regional Conference. New York: ACM Press, 2011: 86-91. [12] PETERSON E A, TANG P. Fast approximation of probabilistic frequent closed itemsets[C]//ACM-SE 2012: Proceedings of the 50th Annual Southeast Regional Conference. New York: ACM Press,2012: 214-219. [13] BERNECKER T, CHENG R, CHEUNG D W, et al. Model-based probabilistic frequent itemset mining[J]. Knowledge and Information System, 2013, 37(1): 181-217. [14] LIU X, MAO G, SUN Y, et al. An algorithm to approximately mine frequent closed itemsets from data streams[J]. Acta Electronica Sinica, 2007, 35(5):900-905. (刘旭,毛国君,孙岳,等.数据流中频繁闭项集的近似挖掘算法[J].电子学报,2007,35(5): 900-905.) [15] SEEJA K R. Feature selection based on closed frequent itemset mining: a case study on SAGE data classification[J]. Neurocomputing, 2015, 151(3): 1027-1032. |