Non-iteration Parallel Algorithm for Frequent Pattern Discovery

摘要：

　　For the high time overhead problems of Apriori algorithm while solving for the long length frequent patterns,using the MapReduce distributed programming ideas,the paper breaks the original idea of Aproiri which discovers the frequent item sets through gradually increasing the element numbers in the frequent item sets.It proposes a new non-iteration parallel algorithm about frequent pattern discovery,which can get arbitrary length frequent pattern at random.The experimental results show that the proposed algorithm has better time performance than such parallel algorithms which are under the ideas of traditional Apriori algorithm.

关键词： frequent pattern discovery parallel algorithm non-iteration MapReduce

作者: Chun Liu Yuqiang Li

作者单位: School of Computer Science and Technology Wuhan University of Technology,Wuhan,China

会议类型: 国际会议

会议名称: The 13th International Symposium on Distributed Computing and Applications to Business,Engineering and Science(DCABES 2014)(第十三届分布式计算及其应用国际学术研讨会)

会议地点: 湖北咸宁

会议语种:英文

页码: 127-132

在线出版日期: 2014-11-24（万方平台首次上网日期，不代表论文的发表时间）