[1] SOLANKI S K, PATEL J T. A survey on association rule mining[C]//ACCT 2015:Proceedings of the 20155th International Conference on Advanced Computing & Communication Technologies. Washington, DC:IEEE Computer Society, 2015:212-216. [2] 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. [3] KARTHIKEYAN T, RAVIKUMAR N. A survey on association rule mining[J]. International Journal of Advanced Research in Computer and Communication Engineering, 2014, 3(1):5223-5227. [4] LE B, VO B, HUYNH-THI-LE Q, et al. Enhancing the mining top-rank-k frequent patterns[C]//SMC 2014:Proceedings of the 2014 IEEE International Conference on Systems, Man and Cybernetics. Piscataway, NJ:IEEE, 2014:2008-2012. [5] HAN J, WANG J, LU Y, et al. Mining top-k frequent closed patterns without minimum support[C]//ICDM'02:Proceedings of the 2002 IEEE International Conference on Data Mining. Washington, DC:IEEE Computer Society, 2002:211-218. [6] WANG J, HAN J, LU Y, et al. TFP:an efficient algorithm for mining top-k frequent closed itemsets[J]. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(5):652-664. [7] DENG Z-H, FANG G-D. Mining top-rank-k frequent patterns[C]//Proceedings of the 2007 International Conference on Machine Learning and Cybernetics. Piscataway, NJ:IEEE, 2007:851-856. [8] FANG G-D, DENG Z-H. VTK:vertical mining of top-rank-k frequent patterns[C]//FSKD'08:Proceedings of the 20085th International Conference on Fuzzy Systems and Knowledge Discovery. Washington, DC:IEEE Computer Society, 2008, 2:620-624. [9] DENG Z-H. Fast mining top-rank-k frequent patterns by using node-lists[J]. Expert Systems with Applications, 2014, 41(4):1763-1768. [10] HUYNH-THI-LE Q, LE T, VO B, et al. An efficient and effective algorithm for mining top-rank-k frequent patterns[J]. Expert Systems with Applications, 2015, 42(1):156-164. [11] DAM T-L, LI K, FOURNIER-VIGER P, et al. An efficient algorithm for mining top-rank-k frequent patterns[J]. Applied Intelligence, 2016, 45(1):96-111. [12] 吴长汶,张转喜,吴水生,等.从五味太过探讨"甘邪"与消渴病因的关系[J].中华中医药杂志,2015(3):670-672. (WU C W, ZHANG Z X, WU S S, et al. Exploration on the relationship between the sweet-evil and consumptive thirst pathogenesis based on theory of excess of five kinds of taste[J]. China Journal of Traditional Chinese Medicine and Pharmacy, 2015(3):670-672.). [13] 荣开明.复兴中医药学的几点思考[J]. 湖北中医药大学学报,2015,17(2):59-62. (RONG K M. Considerations on revival of TCM[J].Journal of Hubei University of Chinese Medicine, 2015,17(2):59-62.). [14] VO B, HONG T-P, LE B. DBV-Miner:a dynamic bit-vector approach for fast mining frequent closed itemsets[J]. Expert Systems with Applications, 2012, 39(8):7196-7206. [15] DONG J, HAN M. BitTableFI:an efficient mining frequent itemsets algorithm[J]. Knowledge-Based Systems, 2007, 20(4):329-335. [16] SONG W, YANG B, XU Z. Index-BitTableFI:an improved algorithm for mining frequent itemsets[J]. Knowledge-Based Systems, 2008, 21(6):507-513. |