期刊文献+

基于并行Apriori的物流路径频繁模式研究 被引量:6

Research on Logistics Path Frequent Patterns Based on Parallel Apriori
在线阅读 下载PDF
导出
摘要 传统的频繁路径挖掘分析主要通过关联规则算法实现,但其在处理大型数据集时,会产生占用内存过多,数据处理速度慢等问题,对此提出一种基于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.
作者 曹菁菁 任欣欣 徐贤浩 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)
出处 《计算机工程与应用》 CSCD 北大核心 2019年第11期257-264,共8页 Computer Engineering and Applications
基金 国家自然科学基金重点国际(地区)合作与交流项目(No.71620107002) 国家自然科学基金青年项目(No.61502360)
关键词 大数据 频繁路径 HADOOP FUZZY c-means聚类算法 APRIORI算法 big data frequent path Hadoop Fuzzy c-means clustering algorithm Apriori algorithm
  • 相关文献

参考文献6

二级参考文献62

  • 1黄晓英,张剑芳,徐世莲.信息融合技术在智能物流运输系统中的应用[J].包装工程,2004,25(3):74-75. 被引量:6
  • 2陈卓,孟庆春,魏振钢,任丽婕,窦金凤.一种基于网格和密度凝聚点的快速聚类算法[J].哈尔滨工业大学学报,2005,37(12):1654-1657. 被引量:14
  • 3朱蔚恒,印鉴,谢益煌.基于数据流的任意形状聚类算法[J].软件学报,2006,17(3):379-387. 被引量:51
  • 4魏新军.数据挖掘 物流企业提升竞争力的利器[J].中国储运,2007(1):94-95. 被引量:5
  • 5陆锋 段滢滢 袁文.LBS的数据处理技术[J].中国计算机学会通讯,2010,.
  • 6Guha S, Meyerson A, Mishra N, Motwani R, O'Callaghan L. Clustering data streams: theory and practice. IEEE Trans-actions on Knowledge and Data Engineering, 2003, 15(3): 515-528.
  • 7Han J W, Kamber M. Data Mining Concepts and Tech- niques. Beijing: China Machine Press, 2006. 196-211.
  • 8Ester M, Kriegel H P, Sander J, Xu X W. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd International Confer- ence on Knowledge Discovery and Data Mining. Portland, USA: AAAI Press, 1996. 226-231.
  • 9Sander J, Ester M, Kriegel H P, Xu X W. Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Mining and Knowledge Discov- ery, 1998, 2(2): 169-194.
  • 10Hinneburg A, Keim D A. An efficient approach to clustering in large multimedia databases with noise. In: Proceedings of the 4th International Conference on Knowledge Discov- ery and Data Mining. New York, USA: AAAI Press, 1998. 58-65.

共引文献36

同被引文献76

引证文献6

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部