[1] 何军,刘红岩,杜小勇.挖掘多关系关联规则[J].软件学报,2007,18(11):2752-2765.(HE J, LIU H Y, DU X Y. Mining of multi-relational association rules[J]. Journal of Software, 2007, 18(11):2752-2765.) [2] 张忠林,曾庆飞,许凡.动态关联规则的趋势度挖掘方法[J].计算机应用,2012,32(1):196-198.(ZHANG Z L, ZENG Q F, XU F. Method of data tendency measure mining in dynamic association rules[J]. Journal of Computer Applications, 2012, 32(1):196-198. [3] 李杰,徐勇,王云峰,等.面向个性化推荐的强关联规则挖掘系统[J].系统工程理论与实践,2009,29(8):144-152.(LI J, XU Y, WANG Y F, et al. Strongest association rules mining for personalized recommendation[J]. Systems Engineering-Theory & Practice, 2009, 29(8):144-152.) [4] AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large database[C]//SIGMOD 1993:Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. New York:ACM, 1993:207-216. [5] HAN J W,KAMBER M.数据挖掘:概念与技术[M].范明,孟小峰,译.2版.北京:机械工业出版社,2007:146-173.(HAN J W, KAMBER M. Data mining:concepts and techniques[M]. FAN M, MENG X F, translated. 2nd ed. Beijing:China Machine Press, 2007:146-173.) [6] 王勇,吴艳梅,李芬,等.面向比特流数据的未知协议关联分析与识别[J].计算机应用研究,2015,32(1):243-248.(WANG Y, WU Y M, LI F, et al. Protocol identification association analysis in mobile network environment[J]. Application Research of Computers, 2015, 32(1):243-248.) [7] 顾辉,杨青,蒋成功,等.关联规则在成绩分析中的研究及应用[J].计算机应用,2015,35(S1):149-151,198.(GU H, YANG Q, JIANG C G, et al. Research and application of association rules in achievement analysis[J]. Journal of Computer Applications, 2015, 35(S1):149-151, 198.) [8] 王涛伟,周必水.基于DHP的频繁遍历路径挖掘算法[J].杭州电子科技大学学报,2005,25(5):60-63.(WANG T W, ZHOU B S. An algorithm for mining frequent path traversal based on DHP[J]. Journal of Hangzhou Dianzi University, 2005, 25(5):60-63.) [9] 杨燕霞.基于Hadoop平台的并行关联规则挖掘算法研究[D].成都:四川师范大学,2015:31-50.(YANG Y X. Parallel association rule mining algorithm based on Hadoop platform[D]. Chengdu:Sichuan Normal University, 2015:31-50.) [10] 魏兵海.MPI语言绑定:MPI-Delphi, MPI-Java与MPI-Ruby[J]. 计算机科学, 2004, 31(8):185-189.(WEI H B. MPI language bindings:MPI-Delphi, MPI-Java and MPI-Ruby[J]. Computer Science, 2004, 31(8):185-189.) [11] 李建江,崔健,王聃,等.MapReduce并行编程模型研究综述[J].电子学报,2011,39(11):2635-2642.(LI J J, CUI J, WANG R, et al. Survey of MapReduce parallel programming model[J]. Acta Electronica Sinica, 2011, 39(11):2635-2642.) [12] 刘义,景宁,陈荦,等.MapReduce框架下基于R-树的k-近邻连接算法[J].软件学报,2013,24(8):1836-1851.(LIU Y, JING N, CHEN L, et al. Algorithm for processing k-nearest join based on R-tree MapReduce[J]. Journal of Software, 2013, 24(8):1836-1851.) |