基于并行Apriori的物流路径频繁模式研究  

Research on Logistics Path Frequent Patterns Based on Parallel Apriori

作　　者：曹菁菁[1] 任欣欣 徐贤浩[2] CAO Jingjing;REN Xinxin;XU Xianhao(College of Logistics Engineering, Wuhan University of Technology, Wuhan 430063, China;School of Management, Huazhong University of Science and Technology, Wuhan 430074, China)

机构地区：[1]武汉理工大学物流工程学院,武汉430063 [2]华中科技大学管理学院,武汉430074

出　　处：《计算机工程与应用》2019年第11期257-264,共8页Computer Engineering and Applications

基　　金：国家自然科学基金重点国际(地区)合作与交流项目(No.71620107002);国家自然科学基金青年项目(No.61502360)

摘　　要：传统的频繁路径挖掘分析主要通过关联规则算法实现,但其在处理大型数据集时,会产生占用内存过多,数据处理速度慢等问题,对此提出一种基于Fuzzy c-means聚类算法的并行Apriori算法模型。该模型通过Fuzzy c-means算法完成对原始数据集的聚类分析,将同一区域的物流路径数据划分到内部相似度较高的数据类,并利用Apriori算法对各数据类中的频繁模式进行挖掘分析,进而获得各区域的物流频繁路径。同时通过Hadoop平台实现算法的并行化,有效提高算法运行效率和质量。通过对物流频繁路径的挖掘分析,使管理者更清楚货物流向,可为配送路径优化等决策提供支持。The traditional method of frequent path mining analysis is realized by the association rule algorithm. However,when dealing with large data sets, the traditional association rules algorithm will take up too much memory and process data slowly. In this paper, a parallel Apriori algorithm based on Fuzzy c-means clustering algorithm is proposed. The model performs clustering analysis of the original data set by Fuzzy c-means algorithm, divides the logistics path data which is considered as the same district into a data cluster with high similarity. Then the model utilizes the Apriori algorithm to mine the frequent paths in this district, so as to obtain the frequent logistics path of each area. Meanwhile, the algorithm is parallelized through the Hadoop platform, which can effectively improve the efficiency and the quality of the algorithm.Through the analysis of the frequent path of logistics, managers can better understand the flow of goods and make the decision of the optimization of the delivery path.

关 键 词：大数据 频繁路径 HADOOP FUZZY c-means聚类算法 APRIORI算法 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]